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

正则图复杂度的精确闭合游走级数公式及若干相关界

An exact closed walks series formula for the complexity of regular graphs and some related bounds

Gregory P Constantine, Gregory Magda

AI总结:

本研究针对正则图的复杂度(标记生成树数量),建立了正则图补图复杂度与图中闭合游走数量的精确无限交替级数公式,推导得无限类上下界并阐述其在神经元活动生物学问题中的应用。

摘要:

图的复杂度是其标记生成树的数量。本研究在正则图的背景下探讨复杂度,通过无限交替级数建立了正则图补图的复杂度与图中闭合游走数量之间的精确公式。该结果的若干推论给出了此类图复杂度的无限类上下界,还描述了这些数学结果在神经元活动生物学问题中的应用。

英文摘要:

The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to numbers of closed walks in the graph by way of an infinite alternating series. Some consequences of this result yield infinite classes of lower and upper bounds on the complexity of such graphs. Applications of these mathematical results to biological problems on neuronal activity are described.

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

↑