arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0710.5711math.CO
收藏

生成连通图和双连通图

Generating connected and biconnected graphs

Angela Mestre

摘要:

我们着重研究了[A.梅斯特河Oeckl,在量子场论中通过霍普夫代数生成圈图。数学物理杂志,47,122302,2006]。这是一个代数公式,以递归和有效的方式生成所有的连通图。其关键特征是,每个图携带一个标量因子,该因子由其自同构自同构群的阶的倒数给出。本文在图的层次上对该算法进行了改进。此外,我们随后将结果推广到其他类型的连通图,即(边)双连通图,简单图和无环图。我们的方法只包括基本的图形变换。

英文摘要:

We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs in a recursive and efficient manner. The key feature is that each graph carries a scalar factor given by the inverse of the order of its group of automorphisms. In the present paper, we revise that algorithm on the level of graphs. Moreover, we extend the result subsequently to further classes of connected graphs, namely, (edge) biconnected, simple and loopless graphs. Our method consists of basic graph transformations only.

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

↑