Descripción
|
|
---|---|
In this article we study some variants of the domination concept attending to the connectivity of the subgraph generated by the dominant set. This study is restricted to maximal outerplanar graphs. We establish tight combinatorial bounds for connected domination, semitotal domination, independent domination and weakly connected domination for any n-vertex maximal outerplanar graph | |
Internacional
|
Si |
JCR del ISI
|
Si |
Título de la revista
|
Electronic Notes in Discrete Mathematics |
ISSN
|
1571-0653 |
Factor de impacto JCR
|
|
Información de impacto
|
|
Volumen
|
54 |
DOI
|
10.1016/j.endm.2016.09.020 |
Número de revista
|
|
Desde la página
|
109 |
Hasta la página
|
114 |
Mes
|
SIN MES |
Ranking
|