A new method for constructing graphs determined by their generalized spectrum

DOI10.1016/J.LAA.2015.03.026MaRDI QIDQ2341905zbMATH OpenOpenAlexFDO

Authors Lihuan Mao, Fenjin Liu, Wei Wang

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)

Recommendations

• Generalized spectral characterization of rooted product graphs
• A sufficient condition for a family of graphs being determined by their generalized spectra
• On the generalized spectral characterizations of Eulerian graphs
• Generalized spectral characterization of graphs revisited
• A remark on the generalized spectral characterization of the disjoint union of graphs

Cites work

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

Cited in

(21)

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

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

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