Single-hook immanants for complete graphs

MaRDI QIDQ3306240zbMATH OpenFDO

Authors Guihai Yu, Hui Qu, Yaoping Hou

Publication date 12 August 2020

zbMATH Keywords

adjacency matrixcomplete graphLaplacian matrixsingle-hook immanant

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Recommendations

• The Computational Complexity of Immanants
• Immanant Inequalities for Laplacians of Trees
• On the complexity of immanants
• Inequalities for single-hook immanants
• Computing the permanental polynomials of graphs

Cited in

(2)

• Hook immanantal inequalities for Hadamard's function
• The number of n-cycles in a graph

This page was built for publication: Single-hook immanants for complete graphs

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