On conjugate adjacency matrices of a graph

DOI10.1016/j.disc.2006.07.030zbMath1119.05068OpenAlexW2022302534MaRDI QIDQ868333

Mirko Lepović

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.030

zbMATH Keywords

grapheigenvaluecharacteristic polynomialcospectral graphsmain eigenvalueconjugate characteristic polynomial

Mathematics Subject Classification ID

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

Related Items (6)

The polynomial reconstruction problem: the first 50 years ⋮ Unnamed Item ⋮ Conjugate Laplacian matrices of a graph ⋮ On conjugate characteristic polynomial of a graph ⋮ The conjugate characteristic polynomial of some compound graphs ⋮ Some results on walk regular graphs which are cospectral to its complement

Cites Work

• The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
• On the seidel eigenvectors of a graph
• On formal products and angle matrices of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On conjugate adjacency matrices of a graph