2010/12/17 by N. Ghareghani, Narges Ghareghani, B. Manouchehrian +6
Computer Science · Mathematics · #05C12 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO #msc:05C12
paper · pdf · doi:10.48550/arxiv.1012.3942
8 pages, 4 figures
arxiv created 2010/12/17 · openalex publication_date 2010/12/17 · arxiv updated 2010/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we prove that any distance-balanced graph G with Δ(G)≥ |V(G)|-3 is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees T with Δ(T)≥ |V(T)|-3.