2 papers
math.CO2026
Nearly permanental cospectral graphs
Weifang Lv, Quanyu Tang, Wei Wang +1
Let be a simple graph of order with adjacency matrix . The \emph{determinant} and the \emph{permanen}t of the matrix are defined as \[\mathrm{det}A= \sum_{…
math.CO2026
A Family of Simultaneously Cospectral Trees for Degree-Distance Matrices
Limeng Lin, Quanyu Tang, Kehua Wang +1
Spectral characterization of graphs for various graph matrices constitutes a central topic in spectral graph theory. Let be a graph with adjacency matrix , diagonal degre…