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

独立集交错数与退圈数之间一个不等式的简单证明

A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number

Vadim E. Levit, Eugen Mandrescu

摘要:

如果alpha=alpha(G)是图G中独立集的最大尺寸,s_{k}等于图G中基数为k的稳定集的个数,则I(G;x)= s_{0} + s_{1} x+.+ s_{alpha} x^{alpha}是G的独立多项式。本文给出了一个不等式的初等证明:对任意图G,I(G;-1)的绝对值不大于2 ^phi(G),其中phi(G)是它的退圈数.

英文摘要:

If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we provide an elementary proof of the inequality claiming that the absolute value of I(G;-1) is not greater than 2^phi(G), for every graph G, where phi(G) is its decycling number.

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

↑