On adjacent-vertex-distinguishing total coloring of graphs
In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.
Keywordsgraph proper total coloring adjacent-vertex-distinguishing total coloring adjacent-vertex-distinguishing total chromatic number
Unable to display preview. Download preview PDF.
- 6.Chartrand, G., Lesniak-Foster, L., Graph and Digraphs, 2nd ed., Monterey, CA: Wadsworth Brooks/Cole, 1986.Google Scholar
- 7.Hansen, P., Marcotte, O., Graph coloring and application, Rhode Island USA: AMS Providence, 1999.Google Scholar
- 8.Bondy, J. A., Murty, U. S. A., Graph Theory with Applications, London: Macmillan; New York: Elsevier, 1976.Google Scholar