𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton paths in vertex-transitive graphs of order

✍ Scribed by Klavdija Kutnar; Dragan Marušič; Cui Zhang

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Tetravalent vertex-transitive graphs of
Tetravalent vertex-transitive graphs of order 4p
✍ Jin-Xin Zhou 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

A graph is __vertex‐transitive__ if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a __Cayley graph__ if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs

Determining the hamilton-connectedness o
Determining the hamilton-connectedness of certain vertex-transitive graphs
✍ Ming Jiang; Frank Ruskey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Faber and Moore have proposed a class of vertex-transitive digraphs as a model of directed inconnection networks. These networks have attractive degree versus diameter properties. We show that these digraphs are Hamiltonian and provide necessary and sufficient conditions for the existence of a Hamil

On vertex-transitive, non-Cayley graphs
On vertex-transitive, non-Cayley graphs of order pqr
✍ Ákos Seress 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 727 KB

In 1983, D. Maru~ifi initiated the determination of the set NC of non-Cayley numbers. A number n belongs to NC if there exists a vertex-transitive, non-Cayley graph of order n. The status of all non-square-free numbers and the case when n is the product of two primes was settled recently by B.D. McK