Determining the Hamilton-connectedness of certain vertex-transitive graphs

DOI10.1016/0012-365X(94)90023-XzbMath0824.05044MaRDI QIDQ1336694

Frank Ruskey, Ming Jiang

Publication date: 9 November 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationsHamiltoniandiameterHamilton pathHamilton-connectedarrangement graphsvertex-transitive digraphsHamilton-connectednessinconnection networks

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Broadcasting in cycle prefix digraphs ⋮ Vertex-symmetric digraphs with small diameter ⋮ The coolest way to generate combinations ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks

Cites Work

• Unnamed Item
• Unnamed Item
• Arrangement graphs: A class of generalized star graphs
• A group-theoretic model for symmetric interconnection networks
• Embedding of cycles in arrangement graphs
• A survey: Hamiltonian cycles in Cayley graphs