Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/17660
Title: 
Authors: 
Keywords: 
Chromatic polynomial
Flow polynomial
Issue Date: 
2015
Citation: 
Dong, F. (2015). On graphs having no flow roots in the Interval (1, 2). Electronic Journal of Combinatorics, 22(1): P1.82.
Abstract: 
For any graph G, let W(G) be the set of vertices in G of degrees larger than 3. We show that for any bridgeless graph G, if W(G) is dominated by some component of G-W(G), then F(G,λ ) has no roots in (1; 2), where F(G,λ ) is the flow polynomial of G. This result generalizes the known result that F(G,λ ) has no roots in (1, 2) whenever |W(G)| ≤2. We also give some constructions to generate graphs whose flow polynomials have no roots in (1, 2).
URI: 
ISSN: 
1077-8926 (online)
Website: 
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
EJC-22-1-P1.82.pdf519.55 kBAdobe PDFThumbnail
View/Open
Show full item record

Page view(s)

43
Last Week
0
Last month
2
checked on Apr 22, 2019

Download(s)

22
checked on Apr 22, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.