Atnaujinkite slapukų nuostatas

Textbook of Graph Theory [Kietas viršelis]

  • Formatas: Hardback, 238 pages, aukštis x plotis x storis: 234x156x15 mm, weight: 520 g, 2 black & white illustrations
  • Serija: Universitext
  • Išleidimo metai: 17-Dec-1999
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 0387988599
  • ISBN-13: 9780387988597
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 238 pages, aukštis x plotis x storis: 234x156x15 mm, weight: 520 g, 2 black & white illustrations
  • Serija: Universitext
  • Išleidimo metai: 17-Dec-1999
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 0387988599
  • ISBN-13: 9780387988597
Kitos knygos pagal šią temą:
Graph theory has experienced a tremendous growth during the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, and theoretical computer science. This book aims to provide a solid background in the basic topics of graph theory. It covers Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices and a concrete application of triangulated graphs. The book does not presuppose deep knowledge of any branch of mathematics, but requires only the basics of mathematics. It can be used in an advanced undergraduate course or a beginning graduate course in graph theory.

Here is a solid introduction to graph theory, covering Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, Fournier's proof of Kuratowski's theorem on planar graphs, and more. The book does not presuppose deep knowledge of any branch of mathematics, but requires only the basics of mathematics.
Preface vii
Basic Results
1(32)
Introduction
1(1)
Basic Concepts
2(6)
Subgraphs
8(2)
Degrees of Vertices
10(3)
Paths and Connectedness
13(5)
Automorphism of a Simple Graph
18(2)
Line Graphs
20(5)
Operations on Graphs
25(4)
An Application to Chemistry
29(2)
Miscellaneous Exercises
31(2)
Notes
32(1)
Directed Graphs
33(11)
Introduction
33(1)
Basic Concepts
33(2)
Tournaments
35(3)
k-Partite Tournaments
38(6)
Notes
43(1)
Connectivity
44(23)
Introduction
44(1)
Vertex Cuts and Edge Cuts
44(4)
Connectivity and Edge-Connectivity
48(6)
Blocks
54(2)
Cyclical Edge-Connectivity of a Graph
56(1)
Menger's Theorem
57(8)
Exercises
65(2)
Notes
66(1)
Trees
67(16)
Introduction
67(1)
Definition, Characterization, and Simple Properties
67(5)
Centers and Centroids
72(3)
Counting the Number of Spanning Trees
75(4)
Cayley's Formula
79(1)
Helly Property
80(1)
Exercises
81(2)
Notes
82(1)
Independent Sets and Matchings
83(19)
Introduction
83(1)
Vertex Independent Sets and Vertex Coverings
83(2)
Edge-Independent Sets
85(2)
Matchings and Factors
87(3)
Matchings in Bipartite Graphs
90(9)
Perfect Matchings and the Tutte Matrix
99(3)
Notes
101(1)
Eulerian and Hamiltonian Graphs
102(26)
Introduction
102(1)
Eulerian Graphs
102(5)
Hamiltonian Graphs
107(8)
Pancyclic Graphs
115(3)
Hamilton Cycles in Line Graphs
118(6)
2-Factorable Graphs
124(2)
Exercises
126(2)
Notes
127(1)
Graph Colorings
128(24)
Introduction
128(1)
Vertex Colorings
128(4)
Critical Graphs
132(4)
Triangle-Free Graphs
136(2)
Edge Colorings of Graphs
138(6)
Snarks
144(1)
Kirkman's Schoolgirls Problem
145(2)
Chromatic Polynomials
147(5)
Notes
150(2)
Planarity
152(33)
Introduction
152(1)
Planar and Nonplanar Graphs
152(5)
Euler Formula and Its Consequences
157(5)
K5 and K3,3 are Nonplanar Graphs
162(2)
Dual of a Plane Graph
164(3)
The Four-Color Theorem and the Heawood Five-Color Theorem
167(3)
Kuratowski's Theorem
170(8)
Hamiltonian Plane Graphs
178(2)
Tait Coloring
180(5)
Notes
184(1)
Triangulated Graphs
185(14)
Introduction
185(1)
Perfect Graphs
185(2)
Triangulated Graphs
187(3)
Interval Graphs
190(2)
Bipartite Graph B (G) of a Graph G
192(1)
Circular Arc Graphs
193(1)
Exercises
193(2)
Phasing of Traffic Lights at a Road Junction
195(4)
Notes
198(1)
Applications
199(14)
Introduction
199(1)
The Connector Problem
199(1)
Kruskal's Algorithm
200(2)
Prim's Algorithm
202(1)
Shortest-Path Problems
203(2)
Timetable Problem
205(2)
Application to Social Psychology
207(3)
Exercises
210(3)
Notes
210(3)
List of Symbols 213(4)
References 217(6)
Index 223