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

2-连通图的无同构生成及其应用

Isomorph-free generation of 2-connected graphs with applications

Derrick Stolee

摘要:

许多有趣的图族只包含2-连通图,它们具有耳分解。我们开发了一种技术来产生家庭的未标记的2-连通图使用耳扩增和应用这种技术的两个问题。在第一个应用中,我们寻找唯一K_r-饱和图,并找到了顶点数不超过12的唯一K_4-饱和图的列表,支持了这个问题的现有解决方案。在第二个应用中,我们对顶点数不超过12的所有2-连通图证明了边重构猜想。这种方法可以很容易地推广到更多的2-连通图问题。

英文摘要:

Many interesting graph families contain only 2-connected graphs, which have ear decompositions. We develop a technique to generate families of unlabeled 2-connected graphs using ear augmentations and apply this technique to two problems. In the first application, we search for uniquely K_r-saturated graphs and find the list of uniquely K_4-saturated graphs on at most 12 vertices, supporting current conjectures for this problem. In the second application, we verifying the Edge Reconstruction Conjecture for all 2-connected graphs on at most 12 vertices. This technique can be easily extended to more problems concerning 2-connected graphs.

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

↑