𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity

✍ Scribed by Dac Tan, Ngo

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
792 KB
Volume
23
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We define three families @Z and @3 of special tetravalent metacirculant graphs and show that any non-Cayley tetravalent metacirculant graph is isomorphic to a union of disjoint copies of a graph in one of the families a2 or as. Using this result we prove further that every connected non-Cayley tetravalent metacirculant graph has a Hamilton Cycle.

📜 SIMILAR VOLUMES

Tetravalent half-edge-transitive graphs
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs
✍ Xiuyun Wang; Yan-Quan Feng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Let X be a vertex-transitive graph, that is, the automorphism group Aut(X ) of X is transitive on the vertex set of X . The graph X is said to be symmetric if Aut(X ) is transitive on the arc set of X . Suppose that Aut(X ) has two orbits of the same length on the arc set of X . Then X is said to be

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Štefko MiklaviČ; Primož Šparl 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐

Large Cayley graphs and vertex-transitiv
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

On cubic non-Cayley vertex-transitive gr
On cubic non-Cayley vertex-transitive graphs
✍ Klavdija Kutnar,; Dragan Marušič;; Cui Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers __n__ there exists a non‐Cayley vertex‐transitive graph on __n__ vertices. (The term __non‐Cayley numbers__ has later been given to such integers.) Motivated by this problem,