Abstract

Let GG be a connected graph with V(G)={v1,…,vn}V(G)=\{v_1,\ldots,v_n\}. The (i,j)(i,j)-entry of the distance matrix D(G)D(G) of GG is the distance between viv_i and vjv_j. In this article, using the well-known Ramsey's theorem, we prove that for each integer k≥2k\ge 2, there is a finite amount of graphs whose distance matrices have rank kk. We exhibit the list of graphs with distance matrices of rank 22 and 33. 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 η≥1η\ge 1 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.