Semipaired Domination in Some Subclasses of Chordal Graphs

DOI10.46298/dmtcs.6782zbMath1498.05207arXiv2008.13491OpenAlexW3178831799MaRDI QIDQ5038198

Vikash Tripathi, Michael A. Henning, Arti Pandey

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.13491

zbMATH Keywords

NP-completenessgraph algorithmsdominationblock graphssemipaired domination

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect graphs involving semitotal and semipaired domination
• Labelling algorithms for paired-domination problems in block and interval graphs
• Some APX-completeness results for cubic graphs
• Algorithmic aspects of semitotal domination in graphs
• Semipaired domination in maximal outerplanar graphs
• Semipaired domination in claw-free cubic graphs
• Graphs with large semipaired domination number
• Paired-domination in graphs
• Domination versus semipaired domination in trees
• Complexity and algorithms for semipaired domination in graphs

This page was built for publication: Semipaired Domination in Some Subclasses of Chordal Graphs