arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.5643math.CO
收藏

有向图中满足Bang-Jensen,Gutin和Li条件的最长非哈密顿圈

On longest non-Hamiltonian Cycles in Digraphs with the Conditions of Bang-Jensen, Gutin and Li

S. Kh. Darbinyan, I. A. Karapetyan

摘要:

设$D$是$n\geq 4$上的强有向图.在[2,J. Graph Theory 22(2)(1996)181-187)]中,J. Bang-Jensen,G. Gutin和H. Li证明了如下定理:如果对每对具有公共内邻点的不邻顶点$x, y$,(*)$d(x)+d(y)\geq 2n-1$和$min \{d(x), d(y)\}\geq n-1$,或对每对具有公共内邻点或公共外邻点的不邻顶点$x, y$,(**)$min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq n$,则$D$是Hamilton的.本文证明了:(i)若$D$满足条件(*)且$D$的最小半度至少为2,或(ii)若$D$不是有向圈且满足条件(**),则要么$D$包含一个长为$n-1$的圈,要么$n$是偶数且$D$同构于完全二部有向图或同构于完全二部有向图减一条弧.

英文摘要:

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [2, J. Graph Theory 22 (2) (1996) 181-187)], J. Bang-Jensen, G. Gutin and H. Li proved the following theorems: If (*) $d(x)+d(y)\geq 2n-1$ and $min \{d(x), d(y)\}\geq n-1$ for every pair of non-adjacent vertices $x, y$ with a common in-neighbour or (**) $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq n$ for every pair of non-adjacent vertices $x, y$ with a common in-neighbour or a common out-neighbour, then $D$ is hamiltonian. In this paper we show that: (i) if $D$ satisfies the condition (*) and the minimum semi-degree of $D$ at least two or (ii) if $D$ is not directed cycle and satisfies the condition (**), then either $D$ contains a cycle of length $n-1$ or $n$ is even and $D$ is isomorphic to complete bipartite digraph or to complete bipartite digraph minus one arc.

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

↑