# A characterization of trees with equal 2-domination and 2-independence numbers

@article{Brause2017ACO,
title={A characterization of trees with equal 2-domination and 2-independence numbers},
author={Christoph Brause and Michael A. Henning and Marcin Krzywkowski},
journal={Discret. Math. Theor. Comput. Sci.},
year={2017},
volume={19}
}
• Published 21 April 2016
• Mathematics
• Discret. Math. Theor. Comput. Sci.

## References

SHOWING 1-10 OF 14 REFERENCES
Trees with equal 2-domination and 2-independence numbers
• Mathematics
Discuss. Math. Graph Theory
• 2012
This paper provides a constructive characterization of trees with equal 2-domination and 2-independence numbers and proves that 2(G) � �2(G), for every graph G.
Independence and 2-domination in bipartite graphs
• Mathematics
• 2008
For a positive integer k, a set of vertices S in a graph G is said to be a kdominating set if each vertex x in V (G) S has at least k neighbors in S. The order of a smallest k-dominating set of G is
Graffiti . pc on the 2-domination number of a graph
• Mathematics
• 2010
The k-domination number γk(G) of a simple, undirected graph G is the order of a smallest subset D of the vertices of G such that each vertex of G is either in D or adjacent to at least k vertices in
k-Domination and k-Independence in Graphs: A Survey
• Mathematics
Graphs Comb.
• 2012
This paper surveys results on k-domination and k-independence in graphs with positive integer k.
A note on the k-domination number of a graph
• Mathematics
• 1990
The k-domlnation number of a graph G G(V,E), Yk(G), is the least cardlnallty of a set X V such that any vertex in V X is adjacent to at least k vertices of X. Extending a result of Cockayne, Gamble
Domination in graphs : advanced topics
• Mathematics
• 1998
LP-duality, complementarity and generality of graphical subset parameters dominating functions in graphs fractional domination and related parameters majority domination and its generalizations
Fundamentals of domination in graphs
• Political Science
Pure and applied mathematics
• 1998
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of
n-Domination in graphs
• Mathematics
• 1985