Abstract
In this paper we prove that any distance-balanced graph with is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees with .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.