Abstract
Let be a connected graph with . The -entry of the distance matrix of is the distance between and . In this article, using the well-known Ramsey's theorem, we prove that for each integer , there is a finite amount of graphs whose distance matrices have rank . We exhibit the list of graphs with distance matrices of rank and . Besides, we study the rank of the distance matrices of graphs belonging to a family of graphs with their diameters at most two, the trivially perfect graphs. We show that for each there exists a trivially perfect graph with nullity . We also show that for threshold graphs, which are a subfamily of the family of trivially perfect graphs, the nullity is bounded by one.
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.