The semitotal domination problem in block graphs

DOI10.7151/DMGT.2254zbMath1484.05155OpenAlexW2983858766WikidataQ126837565 ScholiaQ126837565MaRDI QIDQ2062683

Yanyan Li

Publication date: 3 January 2022

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

Full work available at URL: https://doi.org/10.7151/dmgt.2254

zbMATH Keywords

NP-completenessdominationblock graphsundirected path graphssemitotal domination

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph designs and isomorphic decomposition (05C51)

Related Items (2)

A linear-time algorithm for weighted paired-domination on block graphs ⋮ Extremal edge general position sets in some graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect graphs involving semitotal and semipaired domination
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• Algorithmic aspects of semitotal domination in graphs
• Edge weighting functions on semitotal dominating sets
• On matching and semitotal domination in graphs
• Dominating Sets in Chordal Graphs
• Semitotal domination in trees
• Complexity and approximation ratio of semitotal domination in graphs
• Total Domination in Graphs
• Semitotal domination in claw-free cubic graphs

This page was built for publication: The semitotal domination problem in block graphs