The genus of the GRAY graph is 7

Dragan Marušič, Tomaž Pisanski, Steve Wilson

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)377-385
Number of pages9
JournalEuropean Journal of Combinatorics
Volume26
Issue number3-4 SPEC. ISS.
DOIs
StatePublished - Apr 2005

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'The genus of the GRAY graph is 7'. Together they form a unique fingerprint.

Cite this