Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Aleid Sahar A."'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 645-660 (2018)
An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph. In t
Externí odkaz:
https://doaj.org/article/4bc308a428ce405fb912db245b46d359
Publikováno v:
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, Vol 25, Iss 3, Pp 5-24 (2017)
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
Externí odkaz:
https://doaj.org/article/04d46bffaed140eda64ecf78acecce3e
Domination of grids has been proved to be a demanding task and with the addition of independence it becomes more challenging. It is known that no grid with $m,n \geq 5$ has an efficient dominating set, also called perfect code, that is, an independen
Externí odkaz:
http://arxiv.org/abs/1604.08521
An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an independent
Externí odkaz:
http://arxiv.org/abs/1511.09262