Skip to main content

Graph Theory

  • Chapter
  • First Online:
Book cover Guide to Discrete Mathematics

Part of the book series: Texts in Computer Science ((TCS))

  • 189k Accesses

Abstract

Graph theory is a practical branch of mathematics that deals with the arrangements of certain objects known as vertices (or nodes) and the relationships between them. It has been applied to practical problems such as the modelling of computer networks; determining the shortest driving route between two cities; the link structure of a website; the travelling salesman problem; and the four-colour problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The 4-colour theorem states that given any map it is possible to colour the regions of the map with no more than four colours such that no two adjacent regions have the same colour. This result was finally proved in the mid-1970s.

  2. 2.

    Königsberg was founded in the thirteenth century by Teutonic knights and was one of the cities of the Hanseatic League. It was the historical capital of East Prussia (part of Germany), and it was annexed by Russia at the end of the Second World War. The German population either fled the advancing Red army or were expelled by the Russians in 1949. The city is now called Kaliningrad. The famous German philosopher, Immanuel Kant, spent all his life in the city, and is buried there.

  3. 3.

    These are named after Sir William Rowan Hamilton, a nineteenth century Irish mathematician and astronomer, who is famous for discovering quaternions [1].

  4. 4.

    We use the term “salesman” to stand for “salesman” or “saleswoman”.

References

  1. Mathematics in Computing. Second Edition, Gerard O’ Regan. Springer. 2012.

    Google Scholar 

  2. Discrete Mathematics. An Introduction for Software Engineers. Mike Piff. Cambridge University Press. 1991.

    Google Scholar 

  3. Discrete Mathematics and its Applications. 7th Edition. Kenneth H. Rosen Mc Graw Hill. 2012.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gerard O’Regan .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

O’Regan, G. (2016). Graph Theory. In: Guide to Discrete Mathematics. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-44561-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44561-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44560-1

  • Online ISBN: 978-3-319-44561-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics