Abstract
Graphs are introduced using binary relations. Complete graphs, complete bipartite graphs, and complements are defined, as are connectedness and degree. The second section is devoted to the Königsberg Bridge problem and traversability. Then general walks are introduced, together with paths and cycles.
Sections 7.4, 7.5, and 7.6 treat three important applications: shortest paths, minimal spanning trees, and Hamilton circuits. Finally, a section is devoted to the enumeration of Hamilton cycles and the Traveling Salesman problem. It is not known whether there is a polynomial-time solution to this problem, so in addition to brute-force enumeration, two approximation algorithms—the nearest-neighbor algorithm and the sorted-edges algorithm—are outlined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Wallis, W.D. (2012). Graph Theory. In: A Beginner's Guide to Discrete Mathematics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-8286-6_7
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8286-6_7
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-8285-9
Online ISBN: 978-0-8176-8286-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)