Almost all trees are co-immanantal

DOI10.1016/0024-3795(91)90159-TMaRDI QIDQ751666zbMATH OpenOpenAlexFDO

Authors Russell Merris

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90159-t

zbMATH Keywords

treeLaplacian matrixadjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Recommendations

• Almost all trees share a complete set of immanantal polynomials
• Hook immanantal inequalities for Laplacians of trees
• Immanant Inequalities for Laplacians of Trees
• The Second Immanantal Polynomial and the Centroid of a Graph
• Laplacian Permanents of Trees

Cites work

• scientific article; zbMATH DE number 3627232 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Inequalities and identities for generalized matrix functions
• Maximal bilinear complexity and codes
• Maximality of the monomial group
• On the complexity of immanants
• Permanental polynomials of graphs
• Recent results in the theory of graph spectra
• The Second Immanantal Polynomial and the Centroid of a Graph
• The complexity of computing the permanent

Cited in

(8)

• On the second immanantal polynomials of graphs
• The Second Immanantal Polynomial and the Centroid of a Graph
• The coefficients of the immanantal polynomial
• Laplacian Permanents of Trees
• Coined quantum walks lift the cospectrality of graphs and trees
• Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
• Applications of multlinear algebra
• The second immanant of some combinatorial matrices

This page was built for publication: Almost all trees are co-immanantal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751666)