On Graphs Having no Flow Roots in the Interval $(1,2)$

Electronic Journal Of Combinatorics

F.M. Dong¹ 

关键词: chromatic polynomial;    flow polynomial;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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,\lambda)$ has no roots in the interval (1,2), where $F(G,\la

【 授权许可】

Others