Almost all trees are co-immanantal

DOI10.1016/0024-3795(91)90159-TzbMath0715.05017OpenAlexW2028114423MaRDI QIDQ751666

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

treeadjacency matrixLaplacian matrix

Mathematics Subject Classification ID

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

Related Items (4)

Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs ⋮ Applications of multlinear algebra ⋮ The coefficients of the immanantal polynomial ⋮ Coined quantum walks lift the cospectrality of graphs and trees

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Inequalities and identities for generalized matrix functions
• Permanental polynomials of graphs
• Recent results in the theory of graph spectra
• Maximal bilinear complexity and codes
• Maximality of the monomial group
• On the complexity of immanants
• The Second Immanantal Polynomial and the Centroid of a Graph
• Generalized Matrix Functions and the Graph Isomorphism Problem

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