A new method for constructing graphs determined by their generalized spectrum

DOI10.1016/J.LAA.2015.03.026zbMath1311.05117OpenAlexW1988224886MaRDI QIDQ2341905

Lihuan Mao, Wei Wang, Fenjin Liu

Publication date: 6 May 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.03.026

zbMATH Keywords

cospectral graphsgraph spectrumgeneralized spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (16)

On the walk matrix of the Dynkin graph \(D_n\) ⋮ The Smith normal form of the walk matrix of the extended Dynkin graph \(\tilde{D}_n\) ⋮ Generalized spectral characterization of rooted product graphs ⋮ Proof of a conjecture on the determinant of the walk matrix of rooted product with a path ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) ⋮ Generalized spectral characterization of mixed graphs ⋮ New families of graphs determined by their generalized spectrum ⋮ A remark on the generalized spectral characterization of the disjoint union of graphs ⋮ Construction of graphs with distinct eigenvalues ⋮ A note on non-\(\mathbb{R}\)-cospectral graphs ⋮ Graphs with \(n - 1\) main eigenvalues ⋮ An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra ⋮ Generalized spectral characterizations of almost controllable graphs ⋮ So's conjecture for integral circulant graphs of 4 types ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(A_n\) ⋮ On the determinant of the \(Q\)-walk matrix of rooted product with a path

Cites Work

• Generalized spectral characterization of graphs revisited
• An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
• Cospectral graphs and the generalized adjacency matrix
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Controllable subsets in graphs
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Combinatorial matrix theory
• A new graph product and its spectrum

This page was built for publication: A new method for constructing graphs determined by their generalized spectrum