Independent domination and matchings in graphs

Authors:
Dieter Rautenbach;Lutz Volkmann
Affiliations:
Equipe Combinatoire, Université Paris 6, 175 rue du Chevaleret, 75013 Paris, France and Lehrstuhl II für Mathematik, RWTH-Aachen, 52056 Aachen, Germany;Lehrstuhl II für Mathematik, RWTH-Aachen, 52056 Aachen, Germany
Venue:
Discrete Mathematics
Year:
2002

Citing 2
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Well-covered graphs and factors

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Well-covered graphs and factors

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)

Quantified Score

Hi-index	0.05

Visualization

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.