Almost all trees share a complete set of immanantal polynomials
From MaRDI portal
Publication:3137763
Recommendations
- Trees and the dynamics of polynomials
- Rooted trees with the same plucking polynomial
- On the characteristic and Laplacian polynomials of trees
- Almost all trees have an even number of independent sets
- scientific article; zbMATH DE number 4021164
- On trees with real-rooted independence polynomial
- Entire functions arising from trees
- A tree distinguishing polynomial
- Tutte polynomials for trees
- scientific article; zbMATH DE number 7583268
Cited in
(15)- Spectra of large random trees
- Immanantal invariants of graphs
- On the Laplacian coefficients of acyclic graphs
- The coefficients of the immanantal polynomial
- Reconstruction of weighted graphs by their spectrum
- Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees
- Which graphs are determined by their spectrum?
- Laplacian matrices of graphs: A survey
- Laplacian graph eigenvectors
- Almost all trees are co-immanantal
- Indistinguishable trees and graphs
- A survey of graph laplacians
- scientific article; zbMATH DE number 7732142 (Why is no real title available?)
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- Almost all trees have quantum symmetry
This page was built for publication: Almost all trees share a complete set of immanantal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137763)
