Pages that link to "Item:Q2014223"
From MaRDI portal
The following pages link to Edge weighting functions on semitotal dominating sets (Q2014223):
Displaying 16 items.
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- A Vizing-type result for semi-total domination (Q1732092) (← links)
- Bounds on the semipaired domination number of graphs with minimum degree at least two (Q2025082) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- The semitotal domination problem in block graphs (Q2062683) (← links)
- Semitotal domination of Harary graphs (Q2081164) (← links)
- Trees with unique minimum semitotal dominating sets (Q2175800) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Semipaired domination in maximal outerplanar graphs (Q2331595) (← links)
- Semipaired domination in claw-free cubic graphs (Q2413648) (← links)
- Graphs with large semipaired domination number (Q2416951) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- A characterization of graphs with semitotal domination number one-third their order (Q6580490) (← links)
- Edge weighting functions on the semitotal dominating set of claw-free graphs (Q6666559) (← links)
