Arrangement graphs: a class of generalized star graphs
Information Processing Letters
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
The (n,k)-star graph: a generalized star graph
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Fault hamiltonicity of augmented cubes
Parallel Computing
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
| Hi-index | 0.98 |
In this paper we consider a class of Cayley graphs that are generated by certain 3-cycles on the alternating group A"n. These graphs are generalizations of the alternating group graph AG"n. We look at the case when the 3-cycles form a ''tree-like structure'', and analyze the Hamiltonian connectivity of such graphs. We prove that even with 2n-7 vertices deleted, the remaining graph is Hamiltonian connected, i.e. there is a Hamiltonian path between every pair of vertices.