arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.00175math.CO
收藏

关于流多项式只有实根的图

On graphs whose flow polynomials have real roots only

Fengming Dong

摘要:

设$G$是一个无桥图。2011年Kung和Royle证明了$G$的流多项式$F(G,λ)$的所有根都是整数当且仅当$G$是弦平面图的对偶。本文研究了一个无桥图$G$是否一定是某个弦平面图的对偶图,如果$F(G,λ)$只有实根。我们的结论是这个问题的答案为$G$是积极的当且仅当$F(G,λ)$没有任何实根的区间$(1,2)$。本文还证明了:对于任何不可分且$3$ -边连通的$G$,若$G-e$对$G$中的每条边$e$也不可分,且$G$的每条$3$ -边割由与$G$的某个顶点关联的边组成,则$P(G,λ)$的所有根都是实根当且仅当$G\in \{L,Z_3,K_4\}$或$F(G,λ)$在区间$(1,2)$中至少包含$9$实根.其中$L$是具有一个顶点和一个环的图,而$Z_3$是具有两个顶点和连接这两个顶点的三条平行边的图。

英文摘要:

Let $G$ be a bridgeless graph. In 2011 Kung and Royle showed that all roots of the flow polynomial $F(G,λ)$ of $G$ are integers if and only if $G$ is the dual of a chordal and plane graph. In this article, we study whether a bridgeless graph $G$ for which $F(G,λ)$ has real roots only must be the dual of some chordal and plane graph. We conclude that the answer of this problem for $G$ is positive if and only if $F(G,λ)$ does not have any real root in the interval $(1,2)$. We also prove that for any non-separable and $3$-edge connected $G$, if $G-e$ is also non-separable for each edge $e$ in $G$ and every $3$-edge-cut of $G$ consists of edges incident with some vertex of $G$, then all roots of $P(G,λ)$ are real if and only if either $G\in \{L,Z_3,K_4\}$ or $F(G,λ)$ contains at least $9$ real roots in the interval $(1,2)$, where $L$ is the graph with one vertex and one loop and $Z_3$ is the graph with two vertices and three parallel edges joining these two vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑