Paired-domination in inflated graphs
From MaRDI portal
Publication:596115
DOI10.1016/j.tcs.2004.02.028zbMath1051.05067OpenAlexW2056878164MaRDI QIDQ596115
Moo Young Sohn, Cheng, T. C. Edwin, Li-ying Kang
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/629
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (13)
A linear-time algorithm for weighted paired-domination on block graphs ⋮ Vertices in all minimum paired-dominating sets of block graphs ⋮ Linear-time algorithm for paired-domination on distance-hereditary graphs ⋮ On restricted edge-connectivity of replacement product graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ Paired Domination in Graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ Total domination in inflated graphs ⋮ Hardness results and approximation algorithms for (weighted) paired-domination in graphs ⋮ Distance paired-domination problems on subclasses of chordal graphs ⋮ A linear-time algorithm for paired-domination on circular-arc graphs ⋮ A proof of a conjecture on the paired-domination subdivision number
Cites Work
This page was built for publication: Paired-domination in inflated graphs