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

研究问题:图的完全数

Research problem: The completion number of a graph

M. Bakonyi, T. Constantinescu

摘要:

受(弦)图和矩阵代数之间显着相互作用的启发,我们将每个图关联到一个所谓的完成数,该数可能对这种相互作用的某些方面进行编码。我们表明,这个数字是不平凡的,我们要求与一个给定的完成数的图的图论表征。

英文摘要:

Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we ask for a graph theoretic characterization of those graphs with a given completion number.

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

↑