| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118367 | European Journal of Combinatorics | 2005 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dragan MaruÅ¡iÄ, Tomaž Pisanski, Steve Wilson,