The genus of the GRAY graph is 7

Dragan Marušič, Tomaž Pisanski, Stephen E Wilson

Research output: Contribution to journalArticle

8 Citations (Scopus)

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

Fingerprint

Genus
Semisymmetric Graph
Cubic Graph
Cartesian product
Graph in graph theory
Triangle

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

The genus of the GRAY graph is 7. / Marušič, Dragan; Pisanski, Tomaž; Wilson, Stephen E.

In: European Journal of Combinatorics, Vol. 26, No. 3-4 SPEC. ISS., 04.2005, p. 377-385.

Research output: Contribution to journalArticle

Marušič, D, Pisanski, T & Wilson, SE 2005, 'The genus of the GRAY graph is 7', European Journal of Combinatorics, vol. 26, no. 3-4 SPEC. ISS., pp. 377-385. https://doi.org/10.1016/j.ejc.2004.01.015
Marušič, Dragan ; Pisanski, Tomaž ; Wilson, Stephen E. / The genus of the GRAY graph is 7. In: European Journal of Combinatorics. 2005 ; Vol. 26, No. 3-4 SPEC. ISS. pp. 377-385.
@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šič and Tomaž Pisanski and Wilson, {Stephen E}",
year = "2005",
month = "4",
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 Inc.",
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, Stephen E

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

VL - 26

SP - 377

EP - 385

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 3-4 SPEC. ISS.

ER -