𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing Infinite One-regular Graphs

✍ Scribed by Aleksander Malnič; Dragan Marušič; Norbert Seifter

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
134 KB
Volume
20
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an infinite family of infinite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

📜 SIMILAR VOLUMES

Constructing an Infinite Family of Cubic
Constructing an Infinite Family of Cubic 1-Regular Graphs
✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163-182] constructed an infinite family of cubic 1-regular graphs of order 2 p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 13

On highly ramsey infinite graphs
On highly ramsey infinite graphs
✍ M. H. Siggers 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract We show that, for __r__ ≥ 2 and __k__ ≥ 3, there exists a positive constant __c__ such that for large enough __n__ there are 2 non‐isomorphic graphs on at most __n__ vertices that are __r__‐ramsey‐minimal for the odd cycle __C__~2__k__+1~. © 2008 Wiley Periodicals, Inc. J Graph Theory 5

Regular factors of regular graphs
Regular factors of regular graphs
✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a

On regular self-complementary graphs
On regular self-complementary graphs
✍ Nora Hartsfield 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

A regular self-complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.

On Hamiltonian-connected regular graphs
On Hamiltonian-connected regular graphs
✍ Ioan Tomescu 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian