Polynomial reconstruction and terminal vertices

DOI10.1016/S0024-3795(02)00385-3zbMATH Open1015.05057MaRDI QIDQ1855397FDOQ1855397

Authors: Irene Sciriha 

Publication date: 5 February 2003

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

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

zbMATH Keywords

eigenvaluesadjacency matrixcharacteristic polynomialcoronasUlam's reconstruction conjecturepolynomial reconstructible

Mathematics Subject Classification ID

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)

Cites Work

• Eigenspaces of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A graph polynomial and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some mappings related to graphs

Cited In (18)

• Graphs with a common eigenvalue deck
• Polynomial reconstruction of signed graphs
• Title not available (Why is that?)
• Terminal polynomials and star-like graphs
• Polynomial reconstruction of signed graphs whose least eigenvalue is close to \(-2\)
• Title not available (Why is that?)
• Notes on the polynomial reconstruction of signed graphs
• Reconstruction of a Polynomial from Its Radon Projections
• The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
• Polynomial reconstruction problem for hypergraphs
• The polynomial reconstruction of unicyclic graphs is unique
• Title not available (Why is that?)
• Reconstruction from one labelled card and more
• The polynomial reconstruction problem: the first 50 years
• An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph
• Polynomial reconstruction of the matching polynomial

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)