A note on edge-distance-balanced property of the generalized Petersen graphs GP(4t, 2). (3rd October 2019)

• Record Type: Journal Article
• Authors: Ezadi, Mahboubeh; Alaeiyan, Mehdi
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 22:Number 7(2019)
• Page Start: 1315
• Page End: 1322
• Publication Date: 2019-10-03
• Subjects: 05C38 -- 05C12; Edge-distance-balanced graph -- Generalized Petersen graph -- Distance-balanced graph; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1688968
• Languages: English
• ISSNs: 0972-0529

Abstract

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 (4 t, 2) is not edge-distance-balanced.