Total outer-connected domination numbers of trees

DOI10.1016/j.dam.2009.06.027zbMath1213.05190OpenAlexW2034961945MaRDI QIDQ967375

Joanna Raczek, Joanna Cyman

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.027

zbMATH Keywords

treestotal domination numbertotal outer-connected domination number

Mathematics Subject Classification ID

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

Related Items

Complexity of total outer-connected domination problem in graphs ⋮ Total outer connected vertex-edge domination ⋮ Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs ⋮ On the total outer-connected domination in 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

Cites Work

• Total outer-connected domination in trees
• Unnamed Item
• Unnamed Item