Abstract
A graph G is said to be edge-distance-balanced if for any edge uv of G, the number of edges closer to u than to v is equal to the number of edges closer to v than to u. Let GP(n, k) be a generalized Petersen graph. It is proven that for any integers t ≥ 5, the generalized Petersen graph GP(4t, 2) is not edge-distance-balanced.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
