Graphs with a common eigenvalue deck
DOI10.1016/j.laa.2008.06.033zbMath1171.05363OpenAlexW2063673111MaRDI QIDQ957997
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.06.033
adjacency matrixreconstructioninterlacing\(\mu \)-core graph\(\mu \)-eigenvectors\(\mu \)-nut graph\(\mu \)-singular deck\(\mu \)-singular graph
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (6)
Cites Work
- On the construction of graphs of nullity one
- Polynomial reconstruction and terminal vertices
- The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
- A graph polynomial and its applications
- The polynomial reconstruction of unicyclic graphs is unique
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graphs with a common eigenvalue deck