Independent [1,2]-number versus independent domination number
A [1; 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every graph. In this paper we provide local conditions,...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-12-01
|
| Series: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/auom-2017-0031 |