Generalization of the total outer-connected domination in graphs

DOI10.1051/RO/2015016zbMATH Open1335.05134OpenAlexW2307651519MaRDI QIDQ2805478FDOQ2805478

Nader Jafari Rad, Lutz Volkmann

Publication date: 11 May 2016

Published in: RAIRO. Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015016

zbMATH Keywords

total dominationtotal outer-connected domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Total outer-connected domination in trees
• A note on the total outer-connected domination number of a tree
• Total outer-connected domination numbers of trees
• Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs

Cited In (7)

• Title not available (Why is that?)
• Outer-\(k\)-connected component domination in graphs
• Title not available (Why is that?)
• The outer-connected domination number of Sierpiński-like graphs
• Total outer-connected domination in trees
• An extension of locating-total domination problem and its complexity
• Title not available (Why is that?)

This page was built for publication: Generalization of the total outer-connected domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805478)