Clever Geek Handbook
📜 ⬆️ ⬇️

Count Franklin

In graph theory, the Franklin graph is a 3- regular graph with 12 vertices and 18 edges [1] .

Count Franklin
Franklin graph hamiltonian.svg
Named after
Tops12
Rib18
Radius3
Diameter3
Girthfour
Automorphisms48 ( Z / 2 Z × S 4 )
Chromatic number2
Chromatic Index3
Rodone
PropertiesCubic
Hamiltonian
Dicotyledonous
No triangles
Perfect
Vertex-transitive

The graph is named after , who disproved Hywood 's hypothesis about the number of colors required for coloring two-dimensional surfaces, divided into cells when nesting the graph [2] [3] . According to Hewood’s hypothesis, the maximum chromatic number of a card on a Klein bottle should be seven, but Franklin proved that for a given graph of six colors it is always sufficient. Count Franklin can be put in a Klein bottle so that it forms a card that requires six colors, which shows that in some cases six colors are enough. This embedding is a Petri dual embedding in the projective plane (the embedding is shown below).

The graph is Hamiltonian and has a chromatic number of 2, a chromatic index of 3, a radius of 3, a diameter of 3, and a girth of 4. It is also a vertex 3-connected and edge-3-connected perfect graph .

Algebraic properties

The automorphism group of the Franklin graph has order 48 and is isomorphic to Z / 2 Z × S 4 , the direct product of the cyclic group Z / 2 Z and the symmetric group S 4 . The group acts transitively on the vertices of the graph.

The characteristic polynomial of the graph of Franklin is

(x-3)(x-one)3(x+one)3(x+3)(x2-3)2.{\ displaystyle (x-3) (x-1) ^ {3} (x + 1) ^ {3} (x + 3) (x ^ {2} -3) ^ {2}. \} {\displaystyle (x-3)(x-1)^{3}(x+1)^{3}(x+3)(x^{2}-3)^{2}.\ }

Gallery

  •  

    The chromatic number of the graph of Franklin is 2.

  •  

    The chromatic index of Count Franklin is 3.

  •  

    An alternative drawing of Count Franklin.

  •  

    Count Franklin, embedded in the projective plane as a truncated .

Notes

  1. ↑ Weisstein, Eric W. Franklin Graph (English) on Wolfram MathWorld .
  2. ↑ Weisstein, Eric W. Heawood conjecture (Eng.) On the Wolfram MathWorld website.
  3. ↑ Franklin, 1934 , p. 363-379.

Literature

  • P. Franklin. A Six Color Problem // J. Math. Phys .. - 1934. - T. 13 . - p . 363-379 .
Source - https://ru.wikipedia.org/w/index.php?title=Gran_Franklin&oldid=84275742


More articles:

  • Little Apple
  • Max Romeo
  • Danilov, Andrey Sergeevich
  • Scholz, Heinrich (politician)
  • Former South African Liberation Movements
  • Svetloozerskoe rural settlement
  • The Man from Grobolla
  • Bergman, Elin
  • Potodeevsky Village Council
  • Guarneri, Pietro

All articles

Clever Geek | 2019