Sign Up to like & get
recommendations!
1
Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-020-02247-9
Abstract: A graph G is $$\ell $$ ℓ -distance-balanced if for each pair of vertices x and y at a distance $$\ell $$ ℓ in G , the number of vertices closer to x than to…
read more here.
Keywords:
distance;
distance balanced;
balanced product;
ell distance ... See more keywords