Decomposition of the line graph of the complete graph into stars

被引：1
作者：
Xin, Yue [1 ]
Yang, Weihua [1 ]
机构：
[1] Taiyuan Univ Technol, Dept Math, Taiyuan 030024, Shanxi, Peoples R China
来源：
DISCRETE MATHEMATICS | 2024年 / 347卷 / 07期
基金：
中国国家自然科学基金;
关键词：
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.
引用
收藏
页数：6
相关论文
共 15 条
  • [1] Akiyama J, 2005, LECT NOTES COMPUT SC, V3330, P25
  • [2] Arthi K., 2021, Serdica Math. J., V47
  • [3] Bondy J. A., 1976, Graph theory with applications
  • [4] Decompositions of line graphs of complete graphs into paths and cycles
    Ganesamurthy, S.
    [J]. DISCRETE MATHEMATICS, 2023, 346 (01)
  • [5] Multidecompositions of line graphs of complete graphs
    Ganesamurthy, S.
    Paulraja, P.
    Srimathi, R.
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (03)
  • [6] Hell P., 1972, Discrete Math., V2, P229
  • [7] HUNG HY, 1977, DISCRETE MATH, V18, P23
  • [8] Uniform coverings of 2-paths with 5-paths in the complete graph
    Kobayashi, M
    Nakamura, G
    Nara, C
    [J]. DISCRETE MATHEMATICS, 2005, 299 (1-3) : 154 - 161
  • [9] Kobayashi M., 2001, Australas. J. Comb., V24, P301
  • [10] Lawless J. F., 1974, Journal of Combinatorial Theory, Series A, V16, P76, DOI 10.1016/0097-3165(74)90073-9
12