arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.3064math.COmath.ACmath.AT
收藏

利用Lozin变换判定图的Castelnuovo-Mumford正则性

Bounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation

Turker Biyikoglu, Yusuf Civan

摘要:

我们证明了当Lozin变换应用于图时,图的(Castelnuovo-Mumford)正则性正好增加一个,因为它发生在它的诱导匹配数上。因此,我们证明了一个图的正则性可以由其诱导匹配数的函数从上界。我们还证明了图的正则性总是小于或等于它的导出匹配数和去循环数之和。

英文摘要:

We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a graph can be bounded from above by a function of its induced matching number. We also prove that the regularity of a graph is always less than or equal to the sum of its induced matching and decycling numbers.

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

↑