Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
The two-distance vertex-distinguishing index χ d 2 ′ ( G ) {\chi }_{d2}^{^{\prime} }\left(G) of graph G G is defined as the smallest integer k k , for which the edges of G G can be properly colored using k k colors. In this way, any pair of vertices at distance of two have distinct sets of colors. The two-distance vertex-distinguishing edge coloring of graphs can be used to solve some network problems. In this article, we used the method of discharging to prove that if G G is a graph with mad ( G ) < 8 3 \left(G)\lt \frac{8}{3} , then χ d 2 ′ ( G ) ≤ max { 7 , Δ + 2 } {\chi }_{d2}^{^{\prime} }\left(G)\le \max \left\{7,\Delta +2\right\} , which improves the result that a graph G G of Δ ( G ) ≥ 4 \Delta \left(G)\ge 4 has χ d 2 ′ ( G ) ≤ Δ ( G ) + 2 {\chi }_{d2}^{^{\prime} }\left(G)\le \Delta \left(G)+2 if mad ( G ) < 5 2 \left(G)\lt \frac{5}{2} , and χ d 2 ′ ( G ) ≤ Δ ( G ) + 3 {\chi }_{d2}^{^{\prime} }\left(G)\le \Delta \left(G)+3 if mad ( G ) < 8 3 \left(G)\lt \frac{8}{3} .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.