Graph Theory

2008
ISBN: 978-1-84628-969-9
Verlag: Springer

Buch, Englisch, Band 244, 663 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1168 g

Reihe: Graduate Texts in Mathematics

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics – computer science, combinatorial optimization, and operations research in particular – but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance.

The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided tohelp the reader master the techniques and reinforce their grasp of the material.

A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters.

Zielgruppe

Research

Autoren/Hrsg.

Murty, U. S. R.

Bondy, Adrian

Fachgebiete

• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Graphs.- Subgraphs.- Connected Graphs.- Trees.- Nonseparable Graphs.- Tree-Search Algorithms.- Flows in Networks.- Complexity of Algorithms.- Connectivity.- Planar Graphs.- The Four-Colour Problem.- Stable Sets and Cliques.- The Probabilistic Method.- Vertex Colourings.- Colourings of Maps.- Matchings.- Edge Colourings.- Hamilton Cycles.- Coverings and Packings in Directed Graphs.- Electrical Networks.- Integer Flows and Coverings.