PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

The strongly distance-balanced property og the generalized Petersen graphs
Dragan Marušič, Aleksander Malnič, Klavdija Kutnar and Štefko Miklavčič
Ars mathematica contemporanea Volume 2, Number 1, pp. 41-47, 2009. ISSN 1855-3966


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 k2 + 4k + 1, the generalized Petersen graph GP(n; k) is not strongly distance–balanced.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8221
Deposited By:Boris Horvat
Deposited On:21 February 2012