Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity |
| |
Authors: | Yong Qin,&Scaron tefko Miklavi? |
| |
Affiliation: | a Center of Computer Network and Information, Maoming University, Maoming 525000, PR China b School of Software Engineering, South China University of Technology, Guangzhou 510641, PR China c Primorska Institute for Natural Science and Technology, University of Primorska, Muzejski trg 2, 6000 Koper, Slovenia |
| |
Abstract: | Let Γ be a connected simple graph, let V(Γ) and E(Γ) denote the vertex-set and the edge-set of Γ, respectively, and let n=|V(Γ)|. For 1≤i≤n, let ei be the element of elementary abelian group which has 1 in the ith coordinate, and 0 in all other coordinates. Assume that V(Γ)={ei∣1≤i≤n}. We define a set Ω by Ω={ei+ej∣{ei,ej}∈E(Γ)}, and let CayΓ denote the Cayley graph over with respect to Ω. It turns out that CayΓ contains Γ as an isometric subgraph. In this paper, the relations between the spectra of Γ and CayΓ are discussed. Some conditions on the existence of Hamilton paths and cycles in Γ are obtained. |
| |
Keywords: | Connected graph Cayley graph Spectrum of a graph Hamilton path Hamilton cycle |
本文献已被 ScienceDirect 等数据库收录! |
|