✦ LIBER ✦

On Non-Cayley Tetravalent Metacirculant Graphs

✍ Scribed by Ngo Dac Tan

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 116 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200066

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-Cayley tetravalent metacirculant gra

Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity

✍ Dac Tan, Ngo 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 792 KB

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 tetra

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

Cubic (m, n)-metacirculant graphs which

Cubic (m, n)-metacirculant graphs which are not Cayley graphs

✍ Ngo Dac Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 540 KB

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,

On bipartite tetravalent graphs

✍ D.H. Smith 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In [ IO, 1 I 1 all non-bipartite distance-transitive graphs of vallency four have been determined. e use a result of Gardinrzr [ 4 ] to enable us to determine thf: bipar ite distance-transitive graphs of valency four. We wx tht definitio s and notation o H wish to exp C'ollege, withou ould not have

On quasi-Cayley graphs

✍ Ginette Gauyacq 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 925 KB

WC introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which contains Cayley graphs, and study some of their properties. By finding vertex-transitive graphs which are not quasi-Cayley graphs we give a negative answer to a question by Fuller and Krishnamurthy on the quas