The degree-distance and transmission-adjacency matrices

arXiv2212.05297MaRDI QIDQ6420133FDOQ6420133

Authors: Carlos A. Alfaro, Octavio Zapata 

Publication date: 10 December 2022

Abstract: Let $G$ be a connected graph with adjacency matrix $A(G)$. The distance matrix $D(G)$ of $G$ has rows and columns indexed by $V(G)$ with $uv$-entry equal to the distance $mathrmdist(u,v)$ which is the number of edges in a shortest path between the vertices $u$ and $v$. The transmission $mathrmtrs(u)$ of $u$ is defined as $su{m}_{vinV(G)}mathrmdist(u,v)$. Let $mathrmtrs(G)$ be the diagonal matrix with the transmissions of the vertices of $G$ in the diagonal, and $mathrmdeg(G)$ 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 $D_{+}^{mathrmdeg}(G):=mathrmdeg(G)+D(G)$, $D^{mathrmdeg}(G):=mathrmdeg(G)-D(G)$, $A_{+}^{mathrmtrs}(G):=mathrmtrs(G)+A(G)$ and $A^{mathrmtrs}(G):=mathrmtrs(G)-A(G)$. In particular, we explore how good the spectrum and the SNF of these matrices are for determining graphs up to isomorphism. We found that the SNF of $A^{mathrmtrs}$ has an interesting behaviour when compared with other classical matrices. We note that the SNF of $A^{mathrmtrs}$ can be used to compute the structure of the sandpile group of certain graphs. We compute the SNF of $D_{+}^{mathrmdeg}$, $D^{mathrmdeg}$, $A_{+}^{mathrmtrs}$ and $A^{mathrmtrs}$ for several graph families. We prove that complete graphs are determined by the SNF of $D_{+}^{mathrmdeg}$, $D^{mathrmdeg}$, $A_{+}^{mathrmtrs}$ and $A^{mathrmtrs}$. Finally, we derive some results about the spectrum of $D^{mathrmdeg}$ and $A^{mathrmtrs}$.

This page was built for publication: The degree-distance and transmission-adjacency matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6420133)