大理大学学报 ›› 2026, Vol. 11 ›› Issue (6): 11-18.

• 数学与计算机科学 • 上一篇    下一篇

完全t-部图的若干研究

  

  1. 1.重庆交通大学土木工程学院,重庆 400074; 2.大理大学数学与计算机学院,云南大理 671003
  • 收稿日期:2025-05-26 出版日期:2026-06-15 发布日期:2026-06-30
  • 通讯作者: 杨利民,教授,博士,E-mail: yanglm65@aliyun.com。
  • 作者简介:杨煌,硕士研究生,主要从事组合数学、图论研究。
  • 基金资助:
    大理大学科研发展基金项目(KY2319101540)

Several Studies on Complete t-Partite Graphs

  1. 1. School of Civil Engineering, Chongqing Jiaotong University, Chongqing 400074, China; 2. College of Mathematics and Computer
    Science, Dali University, Dali, Yunnan 671003, China)
  • Received:2025-05-26 Online:2026-06-15 Published:2026-06-30

摘要: 文章从7个方面阐述了完全t-部图研究的若干成果和问题及猜想:(1)S(n)-因子的计数;(2)稳定集合分拆的计数;(3)色多项式和单峰性;(4)平均色数;(5)独立数和独立多项式;(6)Hosoya指标和Merrifield-Simmons指标;(7)色唯一性。这些结果丰富了极值图论与代数图论的交叉研究。

关键词: S(n)-因子, 稳定集合, 色多项式, 平均色数, 独立多项式

Abstract: The article presents several achievements, problems, and conjectures in the study of complete t-partite graphs from seven
perspectives: (1) the counting formulas of S(n)-factors; (2) the counting formulas of the partitions of stable sets; (3) chromatic polynomials and unimodality; (4) mean color numbers; (5) independence numbers and independence polynomials; (6) the Hosoya index and the Merrifield-Simmons index; (7) the chromatic uniqueness. These findings enrich the intersection of extremal graph theory and algebraic graph theory.

Key words: S(n)-factor, stable set, chromatic polynomial, mean color number, independence polynomial

中图分类号: