arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.03095math.COcs.DM
收藏

可循环性、连通性和周长

Cyclability, Connectivity and Circumference

Niranjan Balachandran, Anish Hebbar

摘要:

在图$G$中,如果存在一个以某种顺序包含顶点的圈,则称顶点的子集$S \subseteq V(G)$是可圈的。如果$k \geq 2$顶点的任何子集是可循环的,则称$G$是$k$ -可循环的。如果任何$k$ \textit{ordered}顶点以该顺序存在于公共圈中,则该图被称为$k$ -有序的。我们证明了当$k \leq \sqrt{n+3}$,$k$ -可圈图也有周长$c(G) \geq 2k$,并且这是最好的可能.此外,当$k \leq \frac{3n}{4} -1$,$c(G) \geq k+2$,和对于$k$ -序图,我们证明了$c(G) \geq \min\{n,2k\}$ .推广了Byer等人关于非Hamilton $k$连通图的最大边数的一个结果,证明了若$G$是$n \geq 2(k^2+k)$阶的$k$连通图,且有$|E(G)| > \binom{n-k}{2} + k^2$,则该图是Hamilton图,且极图是唯一的.

英文摘要:

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$ \textit{ordered} vertices are present in a common cycle in that order, then the graph is said to be $k$-ordered. We show that when $k \leq \sqrt{n+3}$, $k$-cyclable graphs also have circumference $c(G) \geq 2k$, and that this is best possible. Furthermore when $k \leq \frac{3n}{4} -1$, $c(G) \geq k+2$, and for $k$-ordered graphs we show $c(G) \geq \min\{n,2k\}$. We also generalize a result by Byer et al. on the maximum number of edges in nonhamiltonian $k$-connected graphs, and show that if $G$ is a $k$-connected graph of order $n \geq 2(k^2+k)$ with $|E(G)| > \binom{n-k}{2} + k^2$, then the graph is hamiltonian, and moreover the extremal graphs are unique.

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

↑