Graphs whose flow polynomials have only integral roots

DOI10.1016/J.EJC.2011.01.010MaRDI QIDQ2275472zbMATH OpenOpenAlexFDO

Authors Joseph P. S. Kung, Gordon Royle

Publication date 9 August 2011

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.0181

zbMATH Keywords

bridgeless graphplanar chordal graphs

Mathematics Subject Classification ID

Graph polynomials (05C31)

Abstract: We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that it has only real flow roots. Expressed in the language of matroid theory, this result says that the cographic matroids with only integral characteristic roots are the cycle matroids of planar chordal graphs.

Recommendations

• On graphs whose flow polynomials have real roots only
• On graphs having no flow roots in the interval \((1,2)\)
• A zero-free interval for flow polynomials of cubic graphs
• Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
• scientific article; zbMATH DE number 1123787

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A geometric condition for a hyperplane arrangement to be free
• A higher invariant for matroids
• Curious characterizations of projective and affine geometries
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 1123787 (Why is no real title available?)
• scientific article; zbMATH DE number 952950 (Why is no real title available?)
• Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
• Modular Constructions for Combinatorial Geometries
• Modular elements of geometric lattices
• Non-chordal graphs having integral-root chromatic polynomials. II
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
• Zeros of chromatic and flow polynomials of graphs

Cited in

(5)

• A note on flow polynomials of graphs
• On graphs whose flow polynomials have real roots only
• On graphs having no flow roots in the interval \((1,2)\)
• On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture
• A zero-free interval for flow polynomials of cubic graphs

This page was built for publication: Graphs whose flow polynomials have only integral roots

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