The degree-distance and transmission-adjacency matrices
Carlos A. Alfaro, Octavio Zapata

TL;DR
This paper studies the Smith normal form and spectrum of certain matrices derived from graphs, revealing their effectiveness in graph isomorphism and their unique properties, especially for complete graphs.
Contribution
It introduces new matrix forms combining degree, distance, and transmission matrices, analyzing their SNF and spectrum for graph identification and properties.
Findings
SNF of $A^{trs}$ has unique behavior compared to classical matrices.
Complete graphs are uniquely determined by the SNF of these matrices.
Results connect matrix spectra and SNF to graph isomorphism and structure.
Abstract
Let be a connected graph with adjacency matrix . The distance matrix of has rows and columns indexed by with -entry equal to the distance which is the number of edges in a shortest path between the vertices and . The transmission of is defined as . Let be the diagonal matrix with the transmissions of the vertices of in the diagonal, and the diagonal matrix with the degrees of the vertices in the diagonal. In this paper we investigate the Smith normal form (SNF) and the spectrum of the matrices , , and . In particular, we explore how good the spectrum and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Graph theory and applications · graph theory and CDMA systems
