Paired-domination subdivision numbers of graphs
From MaRDI portal
Publication:844217
DOI10.1007/s00373-005-0871-1zbMath1216.05102OpenAlexW2066585122MaRDI QIDQ844217
Odile Favaron, Seyyed Mahmoud Sheikholeslami, Hossein Karami
Publication date: 18 January 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0871-1
Related Items (8)
Semitotal domination subdivision numbers of graphs ⋮ Upper bounds on the paired domination subdivision number of a graph ⋮ Block graphs with large paired domination multisubdivision number ⋮ Complexity of the paired domination subdivision problem ⋮ Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces ⋮ Super domination in trees ⋮ TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS ⋮ A proof of a conjecture on the paired-domination subdivision number
Cites Work
- Paired-domination in claw-free cubic graphs
- Graphs with large paired-domination number
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Paired-domination number of a graph and its complement
- Paired-domination of trees
- Paired-domination
- Paired-domination in graphs
- Hidden superconformal symmetry in M-theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Paired-domination subdivision numbers of graphs