Almost all trees share a complete set of immanantal polynomials
From MaRDI portal
Publication:3137763
DOI10.1002/jgt.3190170404zbMath0782.05038OpenAlexW2013157969MaRDI QIDQ3137763
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
Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees, On the Laplacian coefficients of acyclic graphs, Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves, A survey of graph laplacians, Which graphs are determined by their spectrum?, Spectra of large random trees, Immanantal invariants of graphs, Reconstruction of weighted graphs by their spectrum, Laplacian graph eigenvectors, Laplacian matrices of graphs: A survey