边稳定的等匹配图
Edge-Stable Equimatchable Graphs
摘要:
一个图$G$是\emph{equimatchable},如果$G$的每个最大匹配具有相同的基数。我们感兴趣的是等匹配图,从图中删除任何边保持等匹配性。如果$G\setminus {e}$,即从$G$中去掉边$e$而得到的图,对任何$e \in E(G)$也是等匹配的,我们称一个等匹配图$G$ \emph{edge-stable}。在注意到边稳定的等匹配图是2-连通因子临界图或二部图之后,我们刻画了边稳定的等匹配图。该表征产生$O(\min(n^{3.376}, n^{1.5}m))$时间识别算法。最后,我们介绍并简要讨论了边临界图、点稳定图和点临界等匹配图的相关概念。特别是,我们强调我们的工作和脱落顶点的概念研究之间的联系,并指出一些悬而未决的问题。
英文摘要:
A graph $G$ is \emph{equimatchable} if every maximal matching of $G$ has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability. We call an equimatchable graph $G$ \emph{edge-stable} if $G\setminus {e}$, that is the graph obtained by the removal of edge $e$ from $G$, is also equimatchable for any $e \in E(G)$. After noticing that edge-stable equimatchable graphs are either 2-connected factor-critical or bipartite, we characterize edge-stable equimatchable graphs. This characterization yields an $O(\min(n^{3.376}, n^{1.5}m))$ time recognition algorithm. Lastly, we introduce and shortly discuss the related notions of edge-critical, vertex-stable and vertex-critical equimatchable graphs. In particular, we emphasize the links between our work and the well-studied notion of shedding vertices, and point out some open questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。