English

From the Coxeter graph to the Klein graph

Combinatorics 2012-06-12 v9

Abstract

We show that the 56-vertex Klein cubic graph \G\G' can be obtained from the 28-vertex Coxeter cubic graph \G\G by 'zipping' adequately the squares of the 24 7-cycles of \G\G endowed with an orientation obtained by considering \G\G as a C\mathcal C-ultrahomogeneous digraph, where C\mathcal C is the collection formed by both the oriented 7-cycles C7\vec{C}_7 and the 2-arcs P3\vec{P}_3 that tightly fasten those C7\vec{C}_7 in \G\G. In the process, it is seen that \G\G' is a C{\mathcal C}'-ultrahomogeneous (undirected) graph, where C{\mathcal C}' is the collection formed by both the 7-cycles C7C_7 and the 1-paths P2P_2 that tightly fasten those C7C_7 in \G\G'. This yields an embedding of \G\G' into a 3-torus T3T_3 which forms the Klein map of Coxeter notation (7,3)8(7,3)_8. The dual graph of \G\G' in T3T_3 is the distance-regular Klein quartic graph, with corresponding dual map of Coxeter notation (3,7)8(3,7)_8.

Cite

@article{arxiv.1002.1960,
  title  = {From the Coxeter graph to the Klein graph},
  author = {Italo J. Dejter},
  journal= {arXiv preprint arXiv:1002.1960},
  year   = {2012}
}

Comments

9 pages, 3 figures, 3 tables

R2 v1 2026-06-21T14:45:16.411Z