Graph characterising polynomials
From MaRDI portal
Recommendations
- Algebraic invariants of graphs; a study based on computer exploration
- On the bivariate permanent polynomials of graphs
- The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
- Generalized permanental polynomials of graphs
- scientific article; zbMATH DE number 4154487
- scientific article; zbMATH DE number 1191252
- Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
- 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
- Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems
Cited in
(14)- On the reconstruction of graph invariants
- The idiosyncratic polynomial of digraphs
- scientific article; zbMATH DE number 6378508 (Why is no real title available?)
- Polynomial Invariants of Graphs
- Algebraic invariants of graphs; a study based on computer exploration
- On the bivariate permanent polynomials of graphs
- Farrell polynomials on graphs of bounded tree width
- Highly unique network descriptors based on the roots of the permanental polynomial
- Note on the subgraph component polynomial
- Finite-type invariants for graphs and graph reconstructions
- Generalized permanental polynomials of graphs
- Blowup polynomials and delta-matroids of graphs
- Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems
- scientific article; zbMATH DE number 2144997 (Why is no real title available?)
This page was built for publication: Graph characterising polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304820)