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.
|Original language||English (US)|
|Number of pages||9|
|Journal||European Journal of Combinatorics|
|Issue number||3-4 SPEC. ISS.|
|State||Published - Apr 2005|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics