Balaban 11-cage

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Infobox graph In the mathematical field of graph theory, the Balaban 11-cage or Balaban (3,11)-cage is a 3-regular graph with 112 vertices and 168 edges named after Alexandru T. Balaban.[1]

The Balaban 11-cage is the unique (3,11)-cage. It was discovered by Balaban in 1973.[2] The uniqueness was proved by Brendan McKay and Wendy Myrvold in 2003.[3]

The Balaban 11-cage is a Hamiltonian graph and can be constructed by excision from the Tutte 12-cage by removing a small subtree and suppressing the resulting vertices of degree two.[4]

It has independence number 52,[5] chromatic number 3, chromatic index 3, radius 6, diameter 8 and girth 11. It is also a 3-vertex-connected graph and a 3-edge-connected graph.

The characteristic polynomial of the Balaban 11-cage is:

(x3)x12(x26)5(x22)12(x3x24x+2)2
(x3+x26x2)(x4x36x2+4x+4)4
(x5+x48x36x2+12x+4)8.

The automorphism group of the Balaban 11-cage is of order 64.[4]

References

Template:Reflist

References

Template:Refbegin

Template:Refend

  1. Template:MathWorld
  2. Balaban, Alexandru T., Trivalent graphs of girth nine and eleven, and relationships among cages, Revue Roumaine de Mathématiques Pures et Appliquées 18 (1973), 1033-1043. Template:MR
  3. Template:MathWorld
  4. 4.0 4.1 Geoffrey Exoo & Robert Jajcay, Dynamic cage survey, Electr. J. Combin. 15 (2008)
  5. Template:Harvtxt
  6. P. Eades, J. Marks, P. Mutzel, S. North. "Graph-Drawing Contest Report", TR98-16, December 1998, Mitsubishi Electric Research Laboratories.