Adjacent Vertex Distinguishing Total Coloring Of Corona Graphs
DOI:
https://doi.org/10.15520/ajcem.2015.vol4.iss1.20.pp8-19.Abstract
An adjacent vertex distinguishing total coloring of a graph  is a proper total coloring of  such that any pair of adjacent vertices have different color sets. The minimum number of colors needed for such an adjacent vertex distinguishing total coloring of  is its chromatic number and is denoted by In this paper, we have obtained the chromatic number of adjacent vertex distinguishing total coloring(AVDTC) of the following corona graphs:
(i)                 (path,  by path, )
(ii)Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â (cycle, Â by cycle, )
(iii)Â Â Â Â Â Â Â Â Â Â Â Â Â (complete graph, Â by complete graph, )
(iv)Â Â Â Â Â Â Â Â Â Â Â Â Â Â (path, Â by cycle, )
(v)Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â (cycle, Â by path, )
(vi)Â Â Â Â Â Â Â Â Â Â Â Â Â Â (complete graph, Â by path, )
(vii)Â Â Â Â Â Â Â Â Â Â Â Â (complete graph, Â by cycle, )
 AMS Subject Classification: 05C15
Downloads
Published
How to Cite
Issue
Section
License
COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY
Â
All paper submissions must carry the following duly signed by all the authors:
“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.â€
