arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.4804cs.DMmath.CO
收藏

当G^2是Konig-Egervary图时?

When G^2 is a Konig-Egervary graph?

Vadim E. Levit, Eugen Mandrescu

摘要:

图G的平方是指图G^2具有与G中相同的顶点集,并且G^2的一条边连接两个不同的顶点,只要它们在G中的距离至多为2。G是平方稳定图,如果它具有性质alpha(G)=alpha(G^2),其中alpha(G)是G中最大稳定集的大小.本文证明了G ^2是Konig-Egervary图当且仅当G是平方稳定的Konig-Egervary图。

英文摘要:

The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices, whenever the distance between them in G is at most 2. G is a square-stable graph if it enjoys the property alpha(G)=alpha(G^2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph.

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

↑