arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1512.02443cs.DM
收藏

过给定边或顶点的偶圈和奇圈

Even and Odd Cycles Passing a Given Edge or a Vertex

Saieed Akbari, Khashayar Etemadi, Peyman Ezzati, Mehrdad Ghadiri

摘要:

本文给出了$2$ -连通图或$2$ -边连通图中存在通过给定顶点或边的奇圈或偶圈的一些充分条件。给出了2-边连通图中存在通过给定顶点或边的奇回路或偶回路的一些类似条件。证明了如果$G$是一个$2$ -连通的$k$ -正则图$k \geq 3$,则$G$的每条边都包含在一个偶圈中.我们还证明了在$2$ -边连通图中,如果一个顶点的度为奇数,则存在一个包含该顶点的偶圈。

英文摘要:

In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in $2$-connected or $2$-edge connected graphs. We provide some similar conditions for the existence of an odd or even circuit that passing a given vertex or an edge in 2-edge connected graphs. We show that if $G$ is a $2$-connected $k$-regular graph, $k \geq 3$, then every edge of $G$ is contained in an even cycle. We also prove that in a $2$-edge connected graph, if a vertex has odd degree, then there is an even cycle containing this vertex.

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

↑