Cargando…
Extremal values on Zagreb indices of trees with given distance k-domination number
Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k-dominating set of G if for every vertex [Formula: see text] , [Formula: see text] for some vertex [Formula: see text] , where k is a positive integer. The distance k-domination number [Formula: see text] of G is the minimu...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5762821/ https://www.ncbi.nlm.nih.gov/pubmed/29375233 http://dx.doi.org/10.1186/s13660-017-1597-3 |