Almost all trees share a complete set of immanantal polynomials

DOI10.1002/JGT.3190170404zbMATH Open0782.05038OpenAlexW2013157969MaRDI QIDQ3137763FDOQ3137763

Phillip Botti, Russell Merris

Publication date: 13 October 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170404

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

zbMATH Keywords

treeadjacency matrixsymmetric groupirreducible characterdiagonal matriximmanantal polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (13)

• Spectra of large random trees
• Immanantal invariants of graphs
• On the Laplacian coefficients of acyclic graphs
• 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
• Title not available (Why is that?)
• A survey of graph laplacians
• 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)