JOURNAL ARTICLE
On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs
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.
Keywords:
Windmill graph Wheel graph Combinatorics Butterfly graph Graph Friendship graph Mathematics Chromatic scale Vertex (graph theory) Discrete mathematics Graph power Voltage graph Line graph
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.09
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Caching and Content Delivery
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs
Journal: International Conference on Bioinformatics and Biomedical Engineering Year: 2010 Vol: 48 Pages: 1-3
JOURNAL ARTICLE
The adjacent vertex distinguishing total chromatic number
Journal: Discrete Mathematics Year: 2012 Vol: 312 (17)Pages: 2741-2750
JOURNAL ARTICLE
An Upper Bound of the Adjacent-vertex-strong-distinguishing Total Chromatic Number of Graphs
Journal: Advances in Mathematics(China) Year: 2013 Vol: 42 (6)Pages: 801-805
JOURNAL ARTICLE
On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs
Enqiang ZhuFei JiangZepeng LiZehui ShaoJin Xu
Year: 2016 Vol: 252 Pages: 230-234
JOURNAL ARTICLE
On Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs
Journal: Taiwanese Journal of Mathematics Year: 2017 Vol: 21 (2)