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

等匹配无爪图

Equimatchable Claw-Free Graphs

Saieed Akbari, Hadi Alizadeh, Tınaz Ekim, Didem Gözüpek, Mordechai Shalom

摘要:

一个图是等匹配的,如果它的所有的最大匹配具有相同的大小。一个图是无爪的,如果它没有一个爪作为导出子图。在本文中,我们提供了,尽我们所知,第一个特征的claw-free equimatchable图通过确定的equimatchable claw-free图族。这种特征意味着一种有效的识别算法。

英文摘要:

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.

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

↑