On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs

2013 International Conference on Information Technology and Applications Pub Date : 2013-11-16 DOI:10.1109/ITA.2013.96

QianTai Yan, WuZhuang Li

引用次数: 1

Abstract

In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.

查看原文本刊更多论文

若干图的邻顶点强区分全色数

本文给出了车轮图Wn、扇形图Fn、风车图K3、齿轮图Wn、图Dm, 4和图Dm, n的邻顶点强区分总色数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2013 International Conference on Information Technology and Applications

自引率

0.00%

发文量