Total outer-connected domination in trees

DOI10.7151/DMGT.1500zbMath1217.05059OpenAlexW1972605311MaRDI QIDQ2997598

Joanna Cyman

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/87b30c4e75511dd7d2dd907b1e4c7b556a7c71cb

zbMATH Keywords

domination numbertotal outer-connected domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ Complexity of total outer-connected domination problem in graphs ⋮ Total outer connected vertex-edge domination ⋮ Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy ⋮ Certified domination ⋮ Total outer-connected domination numbers of trees ⋮ On the total outer-connected domination in graphs ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ On the complexity of the minimum outer-connected dominating set problem in graphs ⋮ Generalization of the total outer-connected domination in graphs ⋮ TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

This page was built for publication: Total outer-connected domination in trees