Title of article
The genus of the GRAY graph is 7
Author/Authors
Maru?i?، نويسنده , , Dragan and Pisanski، نويسنده , , Toma? and Wilson، نويسنده , , Steve، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
9
From page
377
To page
385
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.
Journal title
European Journal of Combinatorics
Serial Year
2005
Journal title
European Journal of Combinatorics
Record number
1556431
Link To Document