Distance unimodular equivalence of graphs

2008/05/12 by Yaoping Hou, Chingwah Woo, Ching-Wah Woo · 4 citations
Mathematics · Computer Science · Engineering · #Graph theory and applications #Advanced Graph Theory Research #graph theory and CDMA systems

paper · doi:10.1080/03081080600967812

Abstract

Let G be a connected graph and D(G) be its distance matrix. In this article, the Smith normal forms of the integer matrices D(G) are determined for trees, wheels, cycles, complements of cycles and are reduced for complete multipartite graphs.

Cited by

• Smith normal form of some distance matrices
• The Smith normal form of Laplacian matrices of simplicial annuli and high dimensional trees
• The Smith normal form of distance matrices of high dimensional trees
• Enumeration of cospectral and coinvariant graphs

Related

• Smith normal form of some distance matrices
• Spectra of variants of distance matrices of graphs and digraphs: a survey
• Distance ideals of graphs
• On graphs with 2 trivial distance ideals
• On the rank of the distance matrix of graphs