Distance-balanced closure of some graphs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.