The genus of the GRAY graph is 7

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

doi:10.1016/j.ejc.2004.01.015

The genus of the GRAY graph is 7

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

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

11 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 language	English (US)
Pages (from-to)	377-385
Number of pages	9
Journal	European Journal of Combinatorics
Volume	26
Issue number	3-4 SPEC. ISS.
DOIs	https://doi.org/10.1016/j.ejc.2004.01.015
State	Published - Apr 2005

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.ejc.2004.01.015

Cite this

@article{5d8d3cd14eb34ccdb7161287fc20c11b,

title = "The genus of the GRAY graph is 7",

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.",

author = "Dragan Maru{\v s}i{\v c} and Toma{\v z} Pisanski and Steve Wilson",

year = "2005",

month = apr,

doi = "10.1016/j.ejc.2004.01.015",

language = "English (US)",

volume = "26",

pages = "377--385",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "3-4 SPEC. ISS.",

}

TY - JOUR

T1 - The genus of the GRAY graph is 7

AU - Marušič, Dragan

AU - Pisanski, Tomaž

AU - Wilson, Steve

PY - 2005/4

Y1 - 2005/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=12944293002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12944293002&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2004.01.015

DO - 10.1016/j.ejc.2004.01.015

M3 - Article

AN - SCOPUS:12944293002

SN - 0195-6698

VL - 26

SP - 377

EP - 385

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 3-4 SPEC. ISS.

ER -

The genus of the GRAY graph is 7

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this