About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 57. Chapters: Complete graph, Regular graph, Petersen graph, Odd graph, Rook's graph, Mobius-Kantor graph, Cubic graph, Paley graph, Snark, Nauru graph, Symmetric graph, Mobius ladder, Crown graph, Hypercube graph, Moore graph, Desargues graph, Kneser graph, Distance-transitive graph, Schlafli graph, Gray graph, Chvatal graph, Generalized Petersen graph, Folded cube graph, Higman-Sims graph, Heawood graph, Distance-regular graph, Strongly regular graph, Wagner graph, Durer graph, Tutte-Coxeter graph, Clebsch graph, Tutte graph, Cage, Tutte 12-cage, Cube-connected cycles, Brinkmann graph, Hoffman-Singleton graph, Vertex-transitive graph, Ramanujan graph, Cycle graph, Ljubljana graph, Shrikhande graph, Foster graph, Blanu a snarks, Ellingham-Horton graph, Pappus graph, Flower snark, Dyck graph, McGee graph, Holt graph, Semi-symmetric graph, Tietze's graph, Frucht graph, Hall-Janko graph, Random regular graph, F26A graph, Biggs-Smith graph, Folkman graph, Harries-Wong graph, Franklin graph, Harries graph, Robertson graph, Hoffman graph, Null graph, Balaban 11-cage, Balaban 10-cage, Bidiakis cube, Half-transitive graph, Gosset graph, Meredith graph, Hamming graph, Double-star snark, Szekeres snark, Gewirtz graph, Watkins snark, Chang graphs, Local McLaughlin graph, Brouwer-Haemers graph, Dipole graph, Quartic graph. Excerpt: In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named for Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by A. B. Kempe (1886). Donald Knuth ...
