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

利用所有最大匹配的一个共同性质刻画Konig-Egervary图

A characterization of Konig-Egervary graphs using a common property of all maximum matchings

Vadim E. Levit, Eugen Mandrescu

摘要:

图G的独立数,记为alpha(G),是G中最大尺寸的独立集的基数,而mu(G)是G中最大匹配的尺寸,即,匹配的号码。如果G的阶等于alpha(G)+mu(G),则G是Konig-Egervary图.本文给出了Konig-Egervary图的一个新的刻画。我们还得到了属于Konig-Egervary图的所有极大独立集的顶点的一些性质。

英文摘要:

The independence number of a graph G, denoted by alpha(G), is the cardinality of an independent set of maximum size in G, while mu(G) is the size of a maximum matching in G, i.e., its matching number. G is a Konig-Egervary graph if its order equals alpha(G)+mu(G). In this paper we give a new characterization of Konig-Egervary graphs. We also deduce some properties of vertices belonging to all maximum independent sets of a Konig-Egervary graph.

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

↑