Abstract:Let G be a connected graph with V (G) = {v1, . . . , vn}. The (i, j)entry of the distance matrix D(G) of G is the distance between vi and vj. In this article, using the well-known Ramsey's theorem, we prove that for each integer k ≥ 2, there is a finite amount of graphs whose distance matrices have rank k. We exhibit the list of graphs with distance matrices of rank 2 and 3. Besides, we study the rank of the distance matrices of graphs belonging to a family of graphs with their diameters at most two, the trivi… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.