A further study on edge-distance-balanced property of the generalized Petersen graphs GP(6n+8, 3). Issue 7 (3rd October 2021)

• Record Type: Journal Article
• Authors: Ezadi, Mahboubeh
• Is Part Of: Journal of information & optimization sciences. Volume 42:Issue 7(2021)
• Page Start: 1497
• Page End: 1506
• Publication Date: 2021-10-03
• Subjects: 05C38 -- 05C12; Edge-distance-balanced graph -- Generalized Petersen graph -- Distance-balanced graph; Electronic data processing -- Periodicals; Information science -- Periodicals; Mathematical optimization -- Periodicals; 519.6
• DOI: 10.1080/02522667.2021.1939959
• Languages: English
• ISSNs: 0252-2667

Abstract

Abstract: A graph G is said to be edge-distance-balanced if for any edge uν of G, the number of edges closer to u than to ν is equal to the number of edges closer to ν than to u . Let GP ( n, k ) be a generalized Petersen graph. It is proven that for any integers n ≥2, the generalized Petersen graph GP (6 n +8, 3) is not edge-distance-balanced.