| 摘要: |
| 本论文研究了点着色图的无矛盾点连通数的问题，利用树的结构特征获得了特殊图类Tn，k关于无矛盾点连通数的上界和下界，TnΛ、TΛ和Λd关于无矛盾点连通数的上界. |
| 关键词: 无矛盾点连通数 树 上界 下界 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:国家自然科学基金项目（11771058）；湖北省教育厅科学技术研究项目（D20191303）. |
|
| CONFLICT-FREE VERTEX-CONNECTION NUMBER OF SEVERAL TREES |
|
ZHONG Yong, YAN Zh
|
|
School of Information and Mathematics, Yangtze University, 434000, China
|
| Abstract: |
| In this paper, we study the problem of the conflict-free vertex-connection number of vertex coloring graphs, and obtain an upper bound and a lower bound for the conflict-free vertex-connection number of Tn.k and an upper bound for the conflict-free vertex-connection number of TnΛ, TΛand Λd by using the structural characteristics of trees. |
| Key words: conflict-free vertex-connection number tree upper bound lower bound |
