摘要
蛛网图是一个重要的网络拓扑结构,研究它的染色对于网络权的分配和通信网络的设计有重要的指导作用.利用穷举法和组合分析法讨论了蛛网图的邻强边染色,得到了蛛网图的邻强边色数.
The spider web graph is an important network topology,whose coloring plays an important role in guiding for the assign of the network right and the design of the communication network. The adjacent strong edge coloring of the spider web graph is discussed by the exhaustion method and the combination analytic method in the paper. The adjacent strong edge chromatic number of the spider web graph is gained in the paper.
出处
《河南科学》
2014年第2期150-152,共3页
Henan Science
基金
陕西省自然科学基础研究计划项目(2013JM1023)
陕西省教育厅科研计划基金项目(2013JK0570
2013JK0597)
商洛学院科研基金项目(12SKY008)
关键词
蛛网图
邻强边染色
邻强边色数
spider web graph
adjacent strong edge coloring
adjacent strong edge chromatic number
