Abstract
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.
Similar content being viewed by others
References
Burris, A. C., Schelp, R. H., Vertex-distinguishing proper edge-colorings, J. of Graph Theory, 1997, 26(2): 73–82.
Bazgan, C., Harkat-Benhamdine, A., Li, H. et al., On the vertex-distinguishing proper edge-coloring of graphs, J. Combin. Theory, Ser. B, 1999, 75: 288–301.
Balister, P. N., Bollobs, B., Schelp, R. H., Vertex distinguishing colorings of graphs with Δ(G) = 2, Discrete Mathmatics, 2002, 252(2): 17–29.
Zhang Zhongfu, Liu Linzhong, Wang Jianfang, Adjacent strong edge coloring of graphs, Applied Mathematics Letters, 2002, 15(5): 623–626.
Reinhard, D., Graph Theory, New York: Springer-Verlag, Inc., 1997.
Chartrand, G., Lesniak-Foster, L., Graph and Digraphs, 2nd ed., Monterey, CA: Wadsworth Brooks/Cole, 1986.
Hansen, P., Marcotte, O., Graph coloring and application, Rhode Island USA: AMS Providence, 1999.
Bondy, J. A., Murty, U. S. A., Graph Theory with Applications, London: Macmillan; New York: Elsevier, 1976.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Z., Chen, X., Li, J. et al. On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A-Math. 48, 289–299 (2005). https://doi.org/10.1360/03ys0207
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1360/03ys0207