Discussiones Mathematicae Graph Theory 32(2) (2012)
263-270

doi: 10.7151/dmgt.1603

Mustapha Chellali and Nacéra Meddah
LAMDA-RO Laboratory, Department of Mathematics |

**Keywords:** *2*-domination number, *2*-independence number, trees

**2010 Mathematics Subject Classification:** 05C69.

[1] | M. Borowiecki, On a minimaximal kernel of trees, Discuss. Math. 1 (1975) 3--6. |

[2] | M. Chellali, O. Favaron, A. Hansberg and L. Volkmann, , Graphs and Combinatorics, k-domination and k-independence in graphs: A Survey 28 (2012) 1--55, doi: 10.1007/s00373-011-1040-3. |

[3] | O. Favaron, On a conjecture of Fink and Jacobson concerning , J. Combinat. Theory (B) k-domination and k-dependence 39 (1985) 101--102, doi: 10.1016/0095-8956(85)90040-1. |

[4] | J.F. Fink and M.S. Jacobson, , in: Graph Theory with Applications to Algorithms and Computer Science., ed(s), Y. Alavi and A.J. Schwenk (Wiley, New York, 1985) 283--300.n-domination in graphs |

[5] | T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs ( Marcel Dekker, New York, 1998). |

[6] | T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs: Advanced Topics (Marcel Dekker, New York 1998). |

Received 14 September 2010

Revised 10 May 2011

Accepted 11 May 2011