✦ LIBER ✦

Vertex-Transitive Graphs and Accessibility

✍ Scribed by C. Thomassen; W. Woess

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 929 KB
Volume: 58
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long cycles in vertex-transitive graphs

✍ László Babai 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract We prove that every connected vertex‐transitive graph on __n__ ≥ 4 vertices has a cycle longer than (3__n__)^1/2^. The correct order of magnitude of the longest cycle seems to be a very hard question.

Vertex-transitive graphs: Symmetric grap

Vertex-transitive graphs: Symmetric graphs of prime valency

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i

Vertex-transitive graphs that are not Ca

Vertex-transitive graphs that are not Cayley graphs. II

✍ McKay, Brendan D.; Praeger, Cheryl E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 881 KB

The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph that is not a Cayley graph. In 1983, D. MaruSiE asked, "For what values of n does there exist such a graph on n vertices?" We give several new constructions of families of vertex-transitive graphs that are not Cay

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,

The maximum genus of vertex-transitive g

The maximum genus of vertex-transitive graphs

✍ Martin Škoviera; Roman Nedela 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 911 KB

The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4. Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for wh

Cubic vertex-transitive graphs of order

Cubic vertex-transitive graphs of order 2pq

✍ Jin-Xin Zhou; Yan-Quan Feng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S