Almost all trees are co-immanantal

DOI10.1016/0024-3795(91)90159-TzbMATH Open0715.05017OpenAlexW2028114423MaRDI QIDQ751666FDOQ751666

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

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

zbMATH Keywords

treeLaplacian matrixadjacency matrix

Mathematics Subject Classification ID

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

Cites Work

• The complexity of computing the permanent
• Permanental polynomials of graphs
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Recent results in the theory of graph spectra
• Inequalities and identities for generalized matrix functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximality of the monomial group
• Maximal bilinear complexity and codes
• On the complexity of immanants
• The Second Immanantal Polynomial and the Centroid of a Graph

Cited In (6)

• Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on 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
• Applications of multlinear algebra

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)