Paired-domination in inflated graphs
From MaRDI portal
Publication:596115
DOI10.1016/J.TCS.2004.02.028zbMATH Open1051.05067OpenAlexW2056878164MaRDI QIDQ596115FDOQ596115
T. C. Edwin Cheng, Liying Kang, Moo Young Sohn
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
Recommendations
- Paired-domination in graphs
- Paired domination in graphs
- scientific article; zbMATH DE number 1156597
- Total domination in inflated graphs
- scientific article; zbMATH DE number 2188616
- Paired domination in graphs: a survey and recent results
- \(k\)-tuple total domination in inflated graphs
- Paired domination stability in graphs
- Paired domination versus domination and packing number in graphs
- Paired-domination in subdivided star-free graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Paired-domination in graphs
- Title not available (Why is that?)
- Irredundance in inflated graphs
- Paired-domination of trees
- Inflated graphs with equal independence number and upper irredundance number
- Paired-domination
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- A proof of a conjecture on the paired-domination subdivision number
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- Title not available (Why is that?)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Total domination in inflated graphs
- A linear-time algorithm for weighted paired-domination on block graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- Vertices in all minimum paired-dominating sets of block graphs
- Distance paired-domination problems on subclasses of chordal graphs
- On restricted edge-connectivity of replacement product graphs
- Paired Domination in Graphs
This page was built for publication: Paired-domination in inflated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596115)
