摘要
引入了近完全图的概念,并根据其结构特征,给出了近完全图的邻点可区别正常边色数.该结果揭示了完全图中删去一个匹配后其邻点可区别正常边色数的变化情况.
In this paper,near complete graphs are introduced and the adjacent-vertex-distinguishing proper edge chromatic numbers of these graphs are obtained by analyzing their structure.Our results reveal the changes of adjacent-vertex-distinguishing proper edge chromatic numbers between a complete graph and its subgraph obtained by deleting a matching.
作者
陈祥恩
李泽鹏
CHEN Xiang-en;LI Ze-peng(Coll.of Math.Stat.,Northwest Normal Univ.,Lanzhou 730070,China;School of Inform.Sci.Eng.,Lanzhou Univ.,Lanzhou 730000,China)
出处
《高校应用数学学报（A辑）》
CSCD
北大核心
2018年第3期324-330,共7页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金
国家自然科学基金(11761064
61672050
61163037)
兰州大学中央高校基本科研业务费专项资金(lzujbky-2018-37)
关键词
完全图
近完全图
匹配
邻点可区别正常边染色
邻点可区别正常边色数
complete graph
near complete graph
matching
adjacent-vertex-distinguishing proper edge coloring
adjacent-vertex-distinguishing proper edge chromatic number
