A Structural Approach for Independent Domination of Regular Graphs

Document Type

Article

Publication Date

9-24-2015

Department

Mathematics

School

Mathematics and Natural Sciences

Abstract

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.

Publication Title

Graphs and Combinatorics

Volume

31

Issue

5

First Page

1567

Last Page

1588

Link to Full Text

Find in your library

Share

COinS