Degree-similar graphs and cospectral graphs

Yi-Zheng Fan, Ruo-Jie Xing, Yi-Liu Zhang +1

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_{\hat{I}}¼(G):=A(G)-\hat{I}¼D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exist…