In this note, we prove that the largest non contractible to K-P graph of order n with [2n + 3/3] less than or equal to p less than or equal to n, is the Turin's graph T2p-n-1(n). Furthermore, a new upperbound for this problem is determined.
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
He, Xiaocong
Li, Yongtao
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, HNP LAMA, Changsha 410083, Hunan, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Li, Yongtao
Feng, Lihua
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, HNP LAMA, Changsha 410083, Hunan, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Feng, Lihua
ELECTRONIC JOURNAL OF COMBINATORICS,
2024,
31
(03):