Hyper-Hamiltonian circulants

Electronic Journal of Graph Theory and Applications

卷:9

Zbigniew R. Bogdanowicz¹ 

[1] US Army, CCDC Armaments Center,Picatinny, New Jersey 07806, USA;

关键词: hyper-hamiltonian graph, hamilton cycle, circulant, hamiltonian graph;   

DOI  :  10.5614/ejgta.2021.9.1.16

来源: DOAJ

【 摘 要 】

A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.  First, we give the necessary and sufficient conditions for any undirected connected circulant to be hyper-Hamiltonian. Second, we give necessary and sufficient conditions for a connected circulant digraph with two jumps to be hyper-Hamiltonian. In addition, we specify some sufficient conditions for a circulant digraph with arbitrary number of jumps to be hyper-Hamiltonian.

【 授权许可】

Unknown