Jump to content

Pappus graph: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
determined by its spectrum, radius
Twri (talk | contribs)
Line 46: Line 46:
[[Category:Individual graphs]]
[[Category:Individual graphs]]
[[Category:Configurations]]
[[Category:Configurations]]
[[Category:Regular graphs]]


[[fr:Graphe de Pappus]]
[[fr:Graphe de Pappus]]

Revision as of 19:31, 8 January 2010

Pappus graph
The Pappus graph.
Named afterPappus of Alexandria
Vertices18
Edges27
Radius4
Diameter4
Girth6
Automorphisms216
Chromatic number2
Chromatic index3
PropertiesSymmetric
Distance-transitive
Distance-regular
Cubic
Hamiltonian
Table of graphs and parameters

In the mathematical field of graph theory, the Pappus graph is a 3-regular undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration[1]. All the cubic distance-regular graphs are known.[2] The Pappus graph is one of the 13 such graphs.

The Pappus graph has crossing number 5, and is the smallest cubic graph with that crossing number (sequence A110507 in the OEIS). It has girth 6, diameter 4, radius 4, chromatic number 2, chromatic index 3 and is both 3-vertex-connected and 3-edge-connected.

The name "Pappus graph" has also been used to refer to a related nine-vertex graph[3], with a point for each point of the Pappus configuration and an edge for every pair of points on the same line.

Algebraic properties

The automorphism group of the Pappus graph is a group of order 216. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore the Pappus graph is a symmetric graph. It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the Foster census, the Pappus graph, referenced as F018A, is the only cubic symmetric graph on 18 vertices.[4][5]

The characteristic polynomial of the Pappus graph is . It is the only graph with this characteristic polynomial, making it a graph determined by its spectrum.

References

  1. ^ Weisstein, Eric W. "Pappus Graph". MathWorld.
  2. ^ Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, 1989.
  3. ^ Kagno, I. N. (1947), "Desargues' and Pappus' graphs and their groups", American Journal of Mathematics, 69 (4): 859–863, doi:10.2307/2371806
  4. ^ Royle, G. "Cubic Symmetric Graphs (The Foster Census)."
  5. ^ Conder, M. and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41-63, 2002.