# 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} }

A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$. The $2$-domination number $\gamma_2(G)$ is the minimum cardinality of a $2$-dominating set in $G$, and the $2$-independence number $\alpha_2(G)$ is the maximum cardinality of a $2$-independent set in $G$. Chellali and Meddah [{\it Trees with equal $2…

## 7 Citations

A note on the semitotal domination number of trees

- Mathematics
- 2020

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The semitotal domination…

Semitotal domination in trees

- MathematicsDiscret. Math. Theor. Comput. Sci.
- 2018

A parameter that is squeezed between arguably the two most important domination parameters, namely the domination number and the total domination number is studied, namely $\gamma(G)$, which is the minimum cardinality of a semitotal dominating set of G.

On the Equality of Domination Number and 2-Domination Number

- MathematicsDiscussiones Mathematicae Graph Theory
- 2022

Abstract The 2-domination number γ2(G) of a graph G is the minimum cardinality of a set D ⊆ V (G) for which every vertex outside D is adjacent to at least two vertices in D. Clearly, γ2(G) cannot be…

Independent Transversal Total Domination Versus Total Domination in Trees

- MathematicsDiscuss. Math. Graph Theory
- 2021

This work gives several relationships between γtt (T) and γt(T) for trees T which are leading to classify the trees which are satisfying the equality in these bounds.

Bipartite graphs with close domination and k-domination numbers

- Mathematics
- 2020

Abstract Let k k be a positive integer and let G G be a graph with vertex set V ( G ) V(G) . A subset D ⊆ V ( G ) D\subseteq V(G) is a k k -dominating set if every vertex outside D D is adjacent to…

A Survey on Characterizing Trees Using Domination Number

- Environmental ScienceMathematics
- 2022

Ever since the discovery of domination numbers by Claude Berge in the year 1958, graph domination has become an important domain in graph theory that has strengthened itself as a theory and has…

A characterization of trees having a minimum vertex cover which is also a minimum total dominating set

- MathematicsAustralas. J Comb.
- 2019

In this article, a constructive characterization of trees having a $(\gamma_t-\tau)$-set is given.

## References

SHOWING 1-10 OF 14 REFERENCES

Trees with equal 2-domination and 2-independence numbers

- MathematicsDiscuss. 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.

Relating the annihilation number and the 2-domination number of a tree

- MathematicsDiscret. Math.
- 2014

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

- MathematicsGraphs Comb.
- 2012

This paper surveys results on k-domination and k-independence in graphs with positive integer k.

On a conjecture of Fink and Jacobson concerning k-domination and k-dependence

- MathematicsJ. Comb. Theory, Ser. B
- 1985

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 SciencePure 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…