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

无重叠圈的连通图的计数

Counting Connected Graphs without Overlapping Cycles

Richard J. Mathar

摘要:

简单连通图可以根据其圈组成(圈的数目和长度)进行分类。本文导出了圈数和圈长不受限制但无重叠圈的简单连通图的计数级数。这些感兴趣的图的圈对必须没有公共节点或边。计算这些图的配方是基于相关的种植图的计数系列,种植图的多集,丰富的树的递归合成,以及将底层有根块图映射到底层块图的广义Otter公式。

英文摘要:

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no overlapping cycles. Cycle pairs of these graphs of interest must not have common nodes or edges. The recipe of counting these graphs is based on the counting series of the associated planted graphs, multisets of planted graphs, a recursive synthesis of enriched trees, and a generalized Otter's formula that maps the underlying rooted block graphs to the underlying block graphs.

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

↑