Immanantal invariants of graphs

DOI10.1016/j.laa.2003.11.033zbMath1062.05093OpenAlexW1977089431MaRDI QIDQ1779385

Russell Merris

Publication date: 1 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.laa.2003.11.033

zbMATH Keywords

Hamiltonian graphLaplacian matrixInvariantWiener indexPerfect matchingPermutation matrixChemical graphImmanantal polynomialIsomorphic graphs

Mathematics Subject Classification ID

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

Related Items (5)

Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees ⋮ The \(\mu \)-permanent of a tridiagonal matrix, orthogonal polynomials, and chain sequences ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ A Hopf algebra for counting cycles ⋮ The coefficients of the immanantal polynomial

Cites Work

• Permanent of the Laplacian matrix of trees and bipartite graphs
• Permanental polynomials of graphs
• Hook immanantal inequalities for Laplacians of trees
• Hook immanantal inequalities for trees explained
• The rank of a cograph
• Some extremal properties of the degree distance of a graph
• Single-hook characters and hamiltonian circuits^∗
• Almost all trees share a complete set of immanantal polynomials
• Products and Plethysms of Characters with Orthogonal, Symplectic and Symmetric Groups
• The permanent of the Laplacian matrix of a bipartite graph
• The Second Immanantal Polynomial and the Centroid of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Immanantal invariants of graphs