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

图的选择数与能量

Choice Number and Energy of Graphs

Saieed Akbari, Ebrahim Ghorbani

摘要:

图G的能量定义为G的所有特征值的绝对值之和,记为E(G).证明了对任意n阶图G,E(G)>= 2(n-χ(\bar{G}))>= 2(ch(G)-1),且对除少数几个特殊族外的所有图G,E(G)>= 2ch(G),其中\bar{G},χ(G),ch(G)分别是图G的补数,色数和选择数.

英文摘要:

The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. It is proved that E(G)>= 2(n-χ(\bar{G}))>= 2(ch(G)-1) for every graph G of order n, and that E(G)>= 2ch(G) for all graphs G except for those in a few specified families, where \bar{G}, χ(G), and ch(G) are the complement, the chromatic number, and the choice number of G, respectively.

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

↑