$\ell$-distance-balanced graphs

TL;DR

This paper introduces and explores the properties of $ ext{l}$-distance-balanced graphs, focusing on those with diameter at most 3 and analyzing well-known families like generalized Petersen graphs.

Contribution

It defines $ ext{l}$-distance-balanced graphs, studies their basic properties, and examines specific cases including diameter constraints and classical graph families.

Findings

Characterization of $ ext{l}$-distance-balanced graphs with diameter at most 3

Identification of properties of generalized Petersen graphs related to $ ext{l}$-distance-balancedness

Basic properties and structural insights into $ ext{l}$-distance-balanced graphs

Abstract

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G$ such that $d(u,v)=\ell$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In this paper we present some basic properties of $\ell$-distance-balanced graphs and study in more detail $\ell$-distance-balanced graphs of diameter at most $3$. We also investigate the $\ell$-distance-balanced property of some well known families of graphs such as the generalized Petersen graphs.