Publication:3926615
From MaRDI portal
zbMath0472.05046MaRDI QIDQ3926615
Publication date: 1979
characteristic polynomialchromatic polynomialisomorphism classflow polynomialrank polynomialidiosyncratic polynomial
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
Some results on the spectral reconstruction problem, On the reconstruction of planar graphs, The idiosyncratic polynomial of digraphs, Techniques in matroid reconstruction, A bibliography on chromatic polynomials, Laplacian spectra and spanning trees of threshold graphs, Reconstruction and higher-dimensional geometry, Cospectral graphs and the generalized adjacency matrix, Unnamed Item, The double reconstruction conjecture about finite colored hypergraphs, The polynomial reconstruction problem: the first 50 years, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, Conditional clusters, musters, and probability, An eigenvector condition for reconstructibility, Note on graphs with irreducible characteristic polynomials, On the spectral invariants of symmetric matrices with applications in the spectral graph theory, Edge reconstruction of the Ihara zeta function, Graphs with a common eigenvalue deck, Spectral conditions for the reconstructibility of a graph, A uniqueness theorem on matrices and reconstruction, Developments in the theory of graph spectra, Matroid Theory for Algebraic Geometers, On a conjecture of He concerning the spectral reconstruction of matrices, Reconstructing subgraph-counting graph polynomials of increasing families of graphs, On the reconstruction of graph invariants, Polynomial reconstruction of the matching polynomial, Some results and approaches for reconstruction conjectures
