𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient domination in cubic vertex-transitive graphs

✍ Scribed by Martin Knor; Primož Potočnik

Book ID
119233251
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
307 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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,

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

Long cycles in vertex-transitive graphs
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.