Title of article
Independent domination and matchings in graphs
Author/Authors
Dieter Rautenbach، نويسنده , , Lutz Volkmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
325
To page
330
Abstract
If G is a graph of order n, independent domination number i and matching number α0, then i+α0⩽n. We characterize all graphs for which equality holds in this inequality and show that this class can be recognized in polynomial time.
Keywords
Domination , Independent domination , Matching , 2-Satisfiability
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949421
Link To Document