A Structural Approach for Independent Domination of Regular Graphs

作者：Lyle Jeremy^*

来源：Graphs and Combinatorics, 2015, 31(5): 1567-1588.

DOI：10.1007/s00373-014-1454-9

• Independent domination
• Maximal independent sets
• Regular graphs

We consider bounds on the minimum cardinality of an independent dominating set in regular graphs with large degree (linear in the number of vertices). Better bounds are obtained for various ranges of the degree. This is done by working with a variant of the clique graph of the complement.

• 出版日期2015-9