The genus of the GRAY graph is 7

Authors:
Dragan Marušič;Tomaž Pisanski;Steve Wilson
Affiliations:
IMFM, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenija;IMFM, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenija;Northern Arizona University, Flagstaff, AZ
Venue:
European Journal of Combinatorics - Special issue: Topological graph theory II
Year:
2005

Citing 4
Cited 2

On the genus of Z3 × Z3 × Z3

European Journal of Combinatorics
Cyclic Haar graphs

Discrete Mathematics - Algebraic and topological methods in graph theory
Polycyclic configurations

European Journal of Combinatorics
The Gray graph revisited

Journal of Graph Theory

Semisymmetric graphs from polytopes

Journal of Combinatorial Theory Series A
On invariant notions of Segre varieties in binary projective spaces

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.