12 papers
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_{…
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…
Generalized spectral closedness of -free graph classes
Wei Wang, Quanyu Tang
In this paper, we investigate the generalized spectral closedness of graph classes defined by a family of forbidden induced subgraphs. To systematically study this pr…
Orthogonal degree-similarity of edge-deleted strongly regular graphs
Yi-Zheng Fan, Wei Wang, Kuo Zhang
Godsil and Sun asked whether, for a strongly regular graph and any two different edges and , the edge-deleted graphs and are degree-similar…
Smith normal forms for coalescences at cospectral vertices
Yi-Zheng Fan, Kuo Zhang, Wei Wang
Let be the generalized -adjacency matrix of a finite graph . Fan, Xing, Zhang, and Wang constructed pairs of non-degree-similar trees for which the Smi…
Factorization of invariant polynomials and generalized spectral characterizations of graphs
Wei Wang, Quanyu Tang
The problem of characterizing graphs by their generalized spectra has received significant attention in recent years. This paper provides a complete proof of a conjecture proposed…