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

图的度序列强连通性的一个有效检验算法

An efficient algorithm to test forcibly-connectedness of graphical degree sequences

Kai Wang

摘要:

给出了一个判定图的度序列是否强连通的算法,并证明了算法的正确性。我们还概述了算法的扩展,以测试是否一个给定的图形度序列是强制$k$连接或不为每个固定的$k\ge 2$。我们通过实验评估表明,该算法是有效的平均,虽然它的最坏情况下的运行时间可能是指数。将我们的测试算法与Ruskey等人的经典算法相结合,我们还采用Ruskey等人的经典算法来枚举长度为$n$的无零图度序列和Barnes和Savage的经典算法来枚举偶数$n$的图划分,得到了关于给定长度为$n$的强连通图度序列和给定偶数$n$的强连通图划分的一些计数结果.在此基础上,我们得到了如下结果:当$n$较大时,(1)长度为$n$的几乎所有无零图度序列都是强制连通的;(2)偶数$n$的几乎所有图划分都是强制连通的.

英文摘要:

We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly $k$-connected or not for every fixed $k\ge 2$. We show through experimental evaluations that the algorithm is efficient on average, though its worst case run time is probably exponential. We also adapt Ruskey et al's classic algorithm to enumerate zero-free graphical degree sequences of length $n$ and Barnes and Savage's classic algorithm to enumerate graphical partitions of even integer $n$ by incorporating our testing algorithm into theirs and then obtain some enumerative results about forcibly connected graphical degree sequences of given length $n$ and forcibly connected graphical partitions of given even integer $n$. Based on these enumerative results we make some conjectures such as: when $n$ is large, (1) almost all zero-free graphical degree sequences of length $n$ are forcibly connected; (2) almost none of the graphical partitions of even $n$ are forcibly connected.

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

↑