Abstract
For any vertex u ∊ V(G), let T N (u) = {u} ∪ {uυ|uυ ∊ E(G), υ ∊ υ(G)} ∪ {υ ∊ υ(G)|uυ ∊ E(G) and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C f(u) = {f(x) | x ∊ T N (u)}. For any two adjacent vertices x and y of V(G) such that C f(x) ≠ C f(y), we refer to f as a k-avsdt-coloring of G (“avsdt” is the abbreviation of “ adjacent-vertex-strongly-distinguishing total”). The avsdt-coloring number of G, denoted by χast(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We prove Δ(G) + 1 ⩽ χast(G) ⩽ Δ(G) + 2 for any tree or unique cycle graph G.
Similar content being viewed by others
References
Bondy A, Murty U S R. Graph Theory with Applications. New York: Macmillan Press, 1976
Burris A C, Schelp R H. Vertex-distinguishing proper edge-coloring. J Graph Theory, 26(2): 70–82 (1997)
Burris A C. Vertex-distinguishing edge-colorings. PhD Dissertation. Memphis: Memphis State University, 1993
Favaron O, Li H, Schelp R H. Strong edge coloring of graphs. Discrete Math, 159: 103–109 (1996)
Balister P N, Bollobás B, Schelp R H. Vertex distinguishing colorings of graphs with Δ(G) = 2. Discrete Math, 252: 17–29 (2002)
Zhang Z F, Chen X E, Li J W, et al. On the adjacent vertex distinguishing total coloring of graphs. Sci China Ser A-Math, 48(3): 289–299 (2005)
Zhang Z F, Liu L Z, Wang J F. Adjacent strong edge coloring of graphs. Appl Math Lett, 15: 623–626 (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Grant Nos. 10771091, 10661007)
Rights and permissions
About this article
Cite this article
Zhang, Z., Cheng, H., Yao, B. et al. On the adjacent-vertex-strongly-distinguishing total coloring of graphs. Sci. China Ser. A-Math. 51, 427–436 (2008). https://doi.org/10.1007/s11425-007-0128-y
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11425-007-0128-y