论文信息 - The genus of the GRAY graph is 7

The genus of the GRAY graph is 7

Using the genus embedding of the Cartesian product of three triangles we prove one can embed the smallest cubic semisymmetric graph on 54 vertices, the so-called Gray graph, in the orientable surface of genus 7, and we prove that such an embedding is optimal.

Dragan Marusic | Tomaz Pisanski | Steve Wilson

[1] Tomaž Pisanski,et al. The edge-transitive but not vertex-transitive cubic graph on 112 vertices , 2005 .

[2] Tomaz Pisanski,et al. The Gray graph revisited , 2000 .

[3] I. Z. Bouwer. On edge but not vertex transitive regular graphs , 1972 .

[4] Martin Skoviera,et al. Lifting Graph Automorphisms by Voltage Assignments , 2000, Eur. J. Comb..

[5] H. Coxeter. Self-dual configurations and regular graphs , 1950 .

[6] Tomaz Pisanski,et al. The cartesian product of three triangles can be embedded into a surface of genus 7 , 1985, Discret. Math..

[7] I. Bouwer. An Edge but not Vertex Transitive Cubic Graph* , 1968, Canadian Mathematical Bulletin.

[8] Tomaz Pisanski,et al. Polycyclic configurations , 2003, Eur. J. Comb..

[9] Derek F. Holt,et al. A graph which is edge transitive but not arc transitive , 1981, J. Graph Theory.

[10] Craig C. Squier,et al. On the genus of the semidirect product of ℤ9 by ℤ3 , 1989, J. Graph Theory.

[11] Craig C. Squier,et al. On the Genus of Z3 × Z3 × Z3 , 1988, Eur. J. Comb..

[12] D. Hilbert,et al. Geometry and the Imagination , 1953 .

[13] Dragan Marusic,et al. Cyclic Haar graphs , 2002, Discret. Math..