In this paper we prove that any distance-balanced graph GG with Δ(G)≥∣V(G)∣−3Δ(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 TT with Δ(T)≥∣V(T)∣−3Δ(T)≥∣V(T)∣−3.
生成讲解博客的中文版本
生成AI智能校验的中文版本