Edge weighting functions on semitotal dominating sets
From MaRDI portal
Publication:2014223
DOI10.1007/S00373-017-1769-4zbMATH Open1441.05171OpenAlexW2586264719MaRDI QIDQ2014223FDOQ2014223
Authors: Michael A. Henning 
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1769-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Upper total domination in claw‐free graphs
- Total Domination in Graphs
- Edge Weighting Functions on Dominating Sets
- Locating-total domination in claw-free cubic graphs
- A semi-induced subgraph characterization of upper domination perfect graphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in graphs
- Upper domination and upper irredundance perfect graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- On matching and semitotal domination in graphs
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- On the upper total domination number of Cartesian products of graphs
- On the computational complexity of upper total domination
- Vertex criticality for upper domination and irredundance
Cited In (16)
- Semitotal domination on AT-free graphs and circle graphs
- A characterization of graphs with semitotal domination number one-third their order
- Algorithmic aspects of semitotal domination in graphs
- Algorithmic aspects of upper paired-domination in graphs
- Perfect graphs involving semitotal and semipaired domination
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- Trees with unique minimum semitotal dominating sets
- Semipaired domination in maximal outerplanar graphs
- A Vizing-type result for semi-total domination
- Graphs with large semipaired domination number
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph
- The semitotal domination problem in block graphs
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Edge weighting functions on the semitotal dominating set of claw-free graphs
- Semitotal domination of Harary graphs
- Semipaired domination in claw-free cubic graphs
This page was built for publication: Edge weighting functions on semitotal dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014223)
