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

有多余1的有向图的结构

The structure of digraphs with excess one

James Tuite

摘要:

一个有向图$G$是\emph{$k$-geodetic},如果对于任何(不一定是不同的)顶点$u,v$,最多有一个从$u$到$v$的有向行走,其长度不超过$k$。具有最小出度$d$的$k$ -测地有向图的阶在有向Moore界$M(d,k) = 1+d+d^2+\dots +d^k$下有界. Moore界仅在$d = 1$和$k = 1$的平凡情况下才能满足,因此寻找具有出度$d$和最小可能阶$M(d,k)+ε$的$k$ -测地有向图是很有意义的,其中$ε$是有向图的\emph{excess}. Miller、Miret和Sillasen最近排除了$k = 3,4$和$d \geq 2$以及$k = 2$和$d \geq 8$的有向图存在多余1的可能性。我们猜想$d,k \geq 2$不存在多余1的有向图,并研究了这个猜想的极小反例的结构。我们严格限制可能的结构的离群函数,并证明了不存在的某些有向图的度为3和多余的1,以及关闭开放的情况$k = 2$和$d = 3,4,5,6,7$离开Miller等人的分析。我们进一步表明,没有对合有向图与多余的1,即任何这样的有向图的离群函数必须包含一个周期的长度为$\geq 3$。

英文摘要:

A digraph $G$ is \emph{$k$-geodetic} if for any (not necessarily distinct) vertices $u,v$ there is at most one directed walk from $u$ to $v$ with length not exceeding $k$. The order of a $k$-geodetic digraph with minimum out-degree $d$ is bounded below by the directed Moore bound $M(d,k) = 1+d+d^2+\dots +d^k$. The Moore bound can be met only in the trivial cases $d = 1$ and $k = 1$, so it is of interest to look for $k$-geodetic digraphs with out-degree $d$ and smallest possible order $M(d,k)+ε$, where $ε$ is the \emph{excess} of the digraph. Miller, Miret and Sillasen recently ruled out the existence of digraphs with excess one for $k = 3,4$ and $d \geq 2$ and for $k = 2$ and $d \geq 8$. We conjecture that there are no digraphs with excess one for $d,k \geq 2$ and in this paper we investigate the structure of minimal counterexamples to this conjecture. We severely constrain the possible structures of the outlier function and prove the non-existence of certain digraphs with degree three and excess one, as well closing the open cases $k = 2$ and $d = 3,4,5,6,7$ left by the analysis of Miller et al. We further show that there are no involutary digraphs with excess one, i.e. the outlier function of any such digraph must contain a cycle of length $\geq 3$.

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

↑