Complete graph;
Line graph;
S-k;
-decomposition;
COVERINGS;
D O I:
10.1016/j.disc.2024.114026
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let S k be the star with k edges, and let L (K-n) be the line graph of the complete graph K n on n vertices. In this paper, we show that if k > 2 is a prime and n >= k + 1, then the line graph L (K-n) has an S k -decomposition if and only if n equivalent to 0,1,2 (mod k). (c) 2024 Elsevier B.V. All rights reserved.
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Ma, Xiaoling
Lei, Lan
论文数: 0引用数: 0
h-index: 0
机构:
Chongqing Technol & Business Univ, Coll Math & Stat, Chongqing 400067, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Lei, Lan
Lai, Hong-Jian
论文数: 0引用数: 0
h-index: 0
机构:
West Virginia Univ, Dept Math, Morgantown, WV 26506 USAXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Lai, Hong-Jian
Zhan, Mingquan
论文数: 0引用数: 0
h-index: 0
机构:
Millersville Univ Pennsylvania, Dept Math, Millersville, PA 17551 USAXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China