Polynomial reconstruction and terminal vertices
From MaRDI portal
(Redirected from Publication:1855397)
eigenvaluesadjacency matrixcharacteristic polynomialcoronasUlam's reconstruction conjecturepolynomial reconstructible
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15)
Recommendations
- scientific article; zbMATH DE number 2061158
- On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
- scientific article; zbMATH DE number 2028636
- The polynomial reconstruction of unicyclic graphs is unique
- Notes on the polynomial reconstruction of signed graphs
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 4135984 (Why is no real title available?)
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- scientific article; zbMATH DE number 3769666 (Why is no real title available?)
- scientific article; zbMATH DE number 125495 (Why is no real title available?)
- scientific article; zbMATH DE number 3497926 (Why is no real title available?)
- A graph polynomial and its applications
- Eigenspaces of graphs
- On some mappings related to graphs
Cited in
(18)- Polynomial reconstruction of signed graphs
- Graphs with a common eigenvalue deck
- Reconstruction of a Polynomial from Its Radon Projections
- Polynomial reconstruction problem for hypergraphs
- The polynomial reconstruction of unicyclic graphs is unique
- Terminal polynomials and star-like graphs
- Polynomial reconstruction of the matching polynomial
- Reconstruction from one labelled card and more
- scientific article; zbMATH DE number 7640508 (Why is no real title available?)
- scientific article; zbMATH DE number 2061158 (Why is no real title available?)
- scientific article; zbMATH DE number 4154487 (Why is no real title available?)
- The polynomial reconstruction problem: the first 50 years
- Polynomial reconstruction of signed graphs whose least eigenvalue is close to \(-2\)
- The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
- An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph
- Notes on the polynomial reconstruction of signed graphs
- On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs
This page was built for publication: Polynomial reconstruction and terminal vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855397)
