On bi-regular graphs determined by their generalized characteristic polynomials

DOI10.1016/J.LAA.2012.12.006zbMath1269.05074OpenAlexW1987754564MaRDI QIDQ1940102

Lihuan Mao, Hongliang Lu, Wei Wang

Publication date: 5 March 2013

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

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

zbMATH Keywords

adjacency matrixcospectral graphsgraph spectrageneralized characteristic polynomialbi-regular graphsdegree diagonal matrix

Mathematics Subject Classification ID

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

Related Items (2)

The characteristic polynomial of a generalized join graph ⋮ On the construction of graphs determined by their generalized characteristic polynomials

Cites Work

• Unnamed Item
• Graphs determined by their generalized characteristic polynomials
• Spectra of graphs
• Which wheel graphs are determined by their Laplacian spectra?
• Developments on spectral characterizations of graphs
• A note on the spectral characterization of \(\theta \)-graphs
• Which graphs are determined by their spectrum?
• Counting paths in graphs
• A generalized characteristic polynomial of a graph having a semifree action
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• The sun graph is determined by its signless Laplacian spectrum

This page was built for publication: On bi-regular graphs determined by their generalized characteristic polynomials