Cargando…
On the characterization of claw-free graphs with given total restrained domination number
A set S of vertices in graph [Formula: see text] is a [Formula: see text] , abbreviated TRDS, of G if every vertex of G is adjacent to a vertex in S and every vertex of [Formula: see text] is adjacent to a vertex in [Formula: see text] . The [Formula: see text] of G, denoted by [Formula: see text] ,...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5055549/ https://www.ncbi.nlm.nih.gov/pubmed/27795896 http://dx.doi.org/10.1186/s40064-016-3387-7 |