Abstract
A graph X is said to be strongly distance-balanced whenever for any edge uv of X and any positive integer i , the number of vertices at distance i from u and at distance i + 1 from v is equal to the number of vertices at distance i + 1 from u and at distance i from v . It is proven that for any integers k ≥ 2 and n ≥ k 2 + 4 k + 1, the generalized Petersen graph GP( n , k ) is not strongly 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 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.
