Distance-balanced closure of some graphs
classification
🧮 math.CO
keywords
distance-balancedclosuredeltagraphclosuresdefinefindgraphs
read the original abstract
In this paper we prove that any distance-balanced graph $G$ with $\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 $T$ with $\Delta(T)\geq |V(T)|-3$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.