A characterization of graphs with semitotal domination number one-third their order
From MaRDI portal
Publication:6580490
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
- Algorithmic aspects of semitotal domination in graphs
- Bounds on domination parameters in graphs: a brief survey
- Bounds on total domination in claw-free cubic graphs
- Domination in intersecting hypergraphs
- Edge weighting functions on semitotal dominating sets
- Locating-total domination in claw-free cubic graphs
- On a conjecture on total domination in claw-free cubic graphs
- On matching and semitotal domination in graphs
- On matching and total domination in graphs
- On the semitotal domination number of line graphs
- Paired-domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Total domination in graphs
This page was built for publication: A characterization of graphs with semitotal domination number one-third their order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580490)