𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the genus of the tensor product of graphs where one factor is a regular graph

✍ Scribed by Tamara Dakić; Tomaž Pisanski

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
918 KB
Volume
134
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The tensor product HOG where G is a 2k-regular graph can be regarded as a covering space of the permutation voltage graph H czk) obtained from H. Assuming that H is suitably imbedded in some orientable surface by modifying the edges of H according to the configuration of G we get the permutation voltage graph H c2') whose permutation derived graph is exactly HOG. This construction can also be extended to the tensor product HOG where G is a (2k+ 1)-regular graph with l-factor. Here we put the sufficient conditions on H and G so that the permutation derived imbedding obtained in this way is a minimal imbedding. We also give sample results -the genus of the tensor products H@K,,,,, and H@Q, are calculated for certain graphs H.

📜 SIMILAR VOLUMES

On genus imbeddings of the tensor produc
On genus imbeddings of the tensor product of graphs
✍ Abay-Asmerom, Ghidewon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 566 KB

In this article new genus results for the tensor product H @ G are presented. The second factor G in H @ G is a Cayley graph. The imbedding technique used to establish these results combines surgery and voltage graph theory. This technique was first used by A. T. White [171. This imbedding technique

On the genus of five- and six-regular gr
On the genus of five- and six-regular graphs
✍ Viera Krňanová Proulx 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

This paper shows how to construct infinitely many regular graphs of degrees five and six having given genus y > 0, which settles favorably Conjecture 1 stated by T. W. Tucker. Tucker has shown that there are infinitely many regular graphs of degrees four and three of arbitrary given genus (Theorem 1

On the average genus of the random graph
On the average genus of the random graph
✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ