Semitotal domination in claw-free cubic graphs
From MaRDI portal
Publication:5915777
DOI10.1007/s00373-017-1826-zzbMath1386.05146OpenAlexW2730718445MaRDI QIDQ5915777
Zehui Shao, Jin Xu, En-Qiang Zhu
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1826-z
Related Items (13)
Semitotal domination subdivision numbers of graphs ⋮ Mixed domination and 2-independence in trees ⋮ Trees with unique minimum semitotal dominating sets ⋮ Semipaired domination in claw-free cubic graphs ⋮ A linear-time algorithm for semitotal domination in strongly chordal graphs ⋮ On the semitotal domination number of line graphs ⋮ A Vizing-type result for semi-total domination ⋮ Unnamed Item ⋮ Complexity and approximation ratio of semitotal domination in graphs ⋮ Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Semipaired domination in maximal outerplanar graphs ⋮ Triangles and (total) domination in subcubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating-total domination in claw-free cubic graphs
- A survey of selected recent results on total domination in graphs
- The \(k\)-dominating graph
- Minimum independent dominating sets of random cubic graphs
- Total Domination in Graphs
- Semitotal domination in claw-free cubic graphs
This page was built for publication: Semitotal domination in claw-free cubic graphs