English

Distance-balanced closure of some graphs

Combinatorics 2010-12-20 v1

Abstract

In this paper we prove that any distance-balanced graph GG with Δ(G)V(G)3\Delta(G)\geq |V(G)|-3 is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees TT with Δ(T)V(T)3\Delta(T)\geq |V(T)|-3.

Keywords

Cite

@article{arxiv.1012.3942,
  title  = {Distance-balanced closure of some graphs},
  author = {N. Ghareghani and B. Manouchehrian and M. Mohammad-Noori},
  journal= {arXiv preprint arXiv:1012.3942},
  year   = {2010}
}

Comments

8 pages, 4 figures

R2 v1 2026-06-21T17:00:39.733Z