科研之友
微信
新浪微博
Facebook
分享链接
摘要
A paired-dominating set is a dominating set whose induced subgraph contains at least one perfect matching. This could model the situation of guards or police where each has a partner or backup. We are interested in those where all "minimal" paired-dominating sets are the same cardinality. In this case, we consider "minimal" to be with respect to the pairings. That is, the removal of any two vertices paired under the matching results in a set that is not dominating. We give a structural characterization of all such graphs with girth at least eight.
- 出版日期2010-8
