Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph

杜建伟; 孙晓玲

您当前的位置：

首页 >

文章列表页 >

Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph

更新时间：2026-09-14

- Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph
- 一类1-树图的邻点可区别全染色
- Vol. 30, Issue 6, Pages: 499-505(2009)
- 作者机构：
  
  中北大学理学院
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2009
- 稿件说明：
移动端阅览
杜建伟, 孙晓玲. Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph[J]. 2009, 30(6): 499-505.
DOI：

杜建伟, 孙晓玲. Research on Adjacent Vertex Distinguishing Total Coloring of a Class of 1-Tree Graph[J]. 2009, 30(6): 499-505. DOI：

摘要

在树和单圈图的邻点可区别全色数基础上

从1-树图的结构特点出发

采用结构分析法和数学归纳法

对一类1-树图的邻点可区别全染色进行了研究

并给出了它的邻点可区别全色数.

Abstract

On the basis of the adjacent vertex distinguishing total chromatic number of the tree and 1-cycle graph

the adjacent vertex distinguishing total coloring of a class of 1-tree graph was mainly discussed by using the structure analysis and mathematical induction.The adjacent vertex distinguishing total chromatic number of a class of 1-tree graph is obtained.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph Theory with Applications[M].London:The Macmillan Press Ltd.,1976.

张忠辅,陈祥恩,李敬文,等.关于图的邻点可区别全染色[J].中国科学:A辑,2004,34(5):574-583.Zhang Zhongfu,Chen Xiangen,Li Jingwen,et al.Adjacent vertex distinguishing total coloring of graphs[J].Science in China,Series A,2004,34(5):574-583.(in Chinese)

马德山,刘林忠,张忠辅.1-树图的邻强边染色[J].数学研究与评论,2000,20(2):299-305.Ma Deshan,Liu Linzhong,Zhang Zhongfu.On the adjacent strong edge coloring of 1-tree[J].Journal ofMathematical Research and Exposition,2000,20(2):299-305.(in Chinese)

孙晓玲,杨爱民,杜建伟.单圈图的邻点可区别全染色[J].山西大学学报(自然科学版),2006,29(2):128-130.Sun Xiaoling,Yang Aimin,Du Jianwei.On the adjacent vertex distinguishing total coloring of 1-cycle[J].Journal ofShanxi University(Natural Sciences),2006,29(2):128-130.(in Chinese)

王治文,王莲花,王继顺,等.关于θ-图的邻点可区别全染色[J].兰州交通大学学报(自然科学版),2004,23(3):13-15.Wang Zhiwen,Wang Lianhua,Wang Jishun,et al.On the adjacent vertex distinguishing total coloring ofθ-graph[J].Journal of Lanzhou Jiaotong University(Natural Sciences),2004,23(3):13-15.(in Chinese)

张和平,欧阳克智.θ-图及其线图的联结数[J].兰州大学学报,1992,28(3):451-453.Zhang Heping,Ouyang Kezhi.The binding number ofθ-graph and its line graph[J].Journal of Lanzhou University,1992,28(3):451-453.(in Chinese)

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

一类外平面图的邻点可区别全染色

一类具有(2t+1)-匹配的树的第二大特征值的下界

树的顶点扩张图的最小直径定向

Application Study of Graph and Tree in Embroider Software

Design of Parallel Robot Experimental Platform Based on Reconfigurable Innovative Components

Related Author

张国珍

李彦军

冯文丽

潘广贞

赵冬娥

Related Institution

山西大学数学科学学院

山西大学商务学院

山西省综合职业技术学院

华北工学院电子工程系

华北工学院计算机系

⁰