On the Hamilton laceability of double generalized Petersen graphs

被引：1
|
作者：
Qiao, Hongwei [1 ]
Meng, Jixiang [1 ]
机构：
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
来源：
DISCRETE MATHEMATICS | 2021年 / 344卷 / 09期
关键词：
Double generalized Petersen graphs; Hamilton-laceable; Hamilton path; Posa exchange; CAYLEY GRAPHS; AUTOMORPHISMS;
D O I：
10.1016/j.disc.2021.112478
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A bipartite graph with bipartition A and B is said to be Hamilton-laceable if for any u is an element of A and v is an element of B there is a Hamilton path joining u and v. It is known that the double generalized Petersen graph DP(n, k) is Hamiltonian and is bipartite if and only if n is even. In this paper we show that the bipartite double generalized Petersen graph DP(n, k) is Hamilton-laceable for n >= 4. (C) 2021 Elsevier B.V. All rights reserved.
引用
下载
收藏
页数：13
相关论文
共 50 条
12345