On conjugate adjacency matrices of a graph

DOI10.1016/J.DISC.2006.07.030zbMATH Open1119.05068OpenAlexW2022302534MaRDI QIDQ868333FDOQ868333

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

graphcospectral graphseigenvaluecharacteristic polynomialmain eigenvalueconjugate characteristic polynomial

Mathematics Subject Classification ID

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

Cites Work

• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
• On formal products and angle matrices of a graph
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Adjacency Matrices
• Type-II matrices attached to conference graphs
• Some results on walk regular graphs which are cospectral to its complement
• Title not available (Why is that?)
• On problems and conjectures on adjointly equivalent graphs
• Commutativity of the adjacency matrices of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The conjugate characteristic polynomial of some compound graphs
• The polynomial reconstruction problem: the first 50 years
• On conjugate characteristic polynomial of a graph
• Conjugate Laplacian matrices of a graph

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

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