On -domination and -independence in graphs
β Scribed by Hansberg, Adriana; Pepper, Ryan
- Book ID
- 122494484
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 400 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The purpose of this paper is to introduce various concepts of g?-domination, which generalize and unify different well-known kinds of domination in graphs. We generalize a result of Lov/tsz concerning the existence of a partition of a set of vertices of G into independent subsets and a result of Fav
Let Ξ΄, Ξ³, i and Ξ± be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-Ξ³-critical if Ξ³ = 3 and the addition of any edge decreases Ξ³ by 1. It was conjectured that any connected 3-Ξ³-critical graph satisf