Abstract
An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing coloring of G is denoted by χ′a(G). In this paper, we prove that χ′a(G)⩽52(Δ+2) for any graph G having maximum degree Δ and no isolated edges. This improves a result in [S. Akbari, H. Bidkhori, N. Nosrati, r-strong edge colorings of graphs, Discrete Math. 306 (2006) 3005–3010], which states that χ′a(G)⩽3Δ for any graph G without isolated edges.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
