Abstract
This article studies real roots of the flow polynomial of a bridgeless graph . For any integer , let be the supremum in such that has no real roots in for all graphs with , where is the set of vertices in of degrees larger than . We prove that can be determined by considering a finite set of graphs and show that for , , and . We also prove that for any bridgeless graph , if all roots of are real but some of these roots are not in the set , then and has at least 9 real roots in .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.