Immanantal polynomials of graph linear combination matrices admit combinatorial coefficient interpretations via vertex orientations, bounds generalizing prior tree and bipartite results, a solution to Merris's open problem, and a star-degree lower bound on root multiplicity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Immanantal polynomials of the linear combination matrices of graphs
Immanantal polynomials of graph linear combination matrices admit combinatorial coefficient interpretations via vertex orientations, bounds generalizing prior tree and bipartite results, a solution to Merris's open problem, and a star-degree lower bound on root multiplicity.