Vertices in all minimum paired-dominating sets of block graphs
From MaRDI portal
Publication:1928534
DOI10.1007/s10878-011-9375-5zbMath1261.90068arXiv0908.2883OpenAlexW2016509330WikidataQ60630596 ScholiaQ60630596MaRDI QIDQ1928534
Zhenbing Zeng, Lei Chen, Chang-hong Lu
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.2883
Cites Work
- Unnamed Item
- Unnamed Item
- Paired-domination in inflated graphs
- Paired-domination in claw-free cubic graphs
- Graphs with large paired-domination number
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Paired-domination of trees
- Vertices contained in all or in no minimum total dominating set of a tree
- Paired-domination in generalized claw-free graphs
- Vertices contained in every minimum dominating set of a tree
- Paired-domination in graphs