Polynomial reconstruction and terminal vertices

DOI10.1016/S0024-3795(02)00385-3zbMath1015.05057MaRDI QIDQ1855397

Irene Sciriha

Publication date: 5 February 2003

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

zbMATH Keywords

eigenvaluescharacteristic polynomialadjacency matrixcoronasUlam's reconstruction conjecturepolynomial reconstructible

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Polynomial reconstruction of signed graphs ⋮ Notes on the polynomial reconstruction of signed graphs ⋮ Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Graphs with a common eigenvalue deck ⋮ Unnamed Item ⋮ On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) ⋮ The polynomial reconstruction of unicyclic graphs is unique

Cites Work

• A graph polynomial and its applications
• On some mappings related to graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial reconstruction and terminal vertices