𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the genus of five- and six-regular graphs

✍ Scribed by Viera Krňanová Proulx

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
130 KB
Volume
7
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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). He also proved that the number of regular graphs of degree greater than six embeddable in a given surface is finite (Corollary to Proposition 1). The case of the regular graphs of degrees six and five was left unanswered (Conjecture 1). This paper also shows a new way of constructing infinitely many regular graphs of degrees three and four of arbitrary genus y > 0.

📜 SIMILAR VOLUMES

Antipodal distance-regular graphs of dia
Antipodal distance-regular graphs of diameter four and five
✍ Tilla Schade 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.

On the Spectral Radius and the Genus of
On the Spectral Radius and the Genus of Graphs
✍ H. Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 205 KB

In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins

On the Circumferences of Regular 2-Conne
On the Circumferences of Regular 2-Connected Graphs
✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let G be a 2-connected d-regular graph on n rd (r 3) vertices and c(G) denote the circumference of G. Bondy conjectured that c(G) 2nÂ(r&1) if n is large enough. In this paper, we show that c(G) 2nÂ(r&1)+2(r&3)Â(r&1) for any integer r 3. In particular, G is hamiltonian if r=3. This generalizes a resu

Blocks and the nonorientable genus of gr
Blocks and the nonorientable genus of graphs
✍ Saul Stahl; Lowell W. Beineke 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract Examples are given to show that the nonorientable genus of a graph is not additive over its blocks. A nonorientable analog for the Battle, Harary, Kodama, and Youngs Theorem is proved; this completely determines the nonorientable genus of a graph in terms of its blocks. It is also shown

A Note on Almost Regular Graphs
A Note on Almost Regular Graphs
✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.

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