Reconstruction from one labelled card and more
From MaRDI portal
Publication:6536720
DOI10.1016/j.laa.2023.08.009zbMath1543.05138MaRDI QIDQ6536720
Publication date: 13 May 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- Graphs with a common eigenvalue deck
- Constructing trees with given eigenvalues and angles
- Polynomial reconstruction and terminal vertices
- On the reconstruction of the characteristic polynomial of a graph
- On the displacement of eigenvalues when removing a twin vertex
- Existence of regular nut graphs for degree at most 11
- On nut and core singular fullerenes
- On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
- A graph polynomial and its applications
- Minimum-rank matrices with prescribed graph
- The polynomial reconstruction problem: the first 50 years
- Coalescing Fiedler and core vertices
- Almost every graph has reconstruction number three
- A characterization of singular graphs
- Coalesced and embedded nut graphs in singular graphs
- The graph reconstruction number
- Generation and properties of nut graphs
- Charting the space of chemical nut graphs
- On 12-regular nut graphs
- Interlacing–extremal graphs
- On the Eigenvalues and Eigenvectors of a Class of Matrices
This page was built for publication: Reconstruction from one labelled card and more
