Pages that link to "Item:Q907832"
From MaRDI portal
The following pages link to Vertices contained in all or in no minimum semitotal dominating set of a tree (Q907832):
Displayed 20 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)
- Edge weighting functions on semitotal dominating sets (Q2014223) (← 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)
- From the strong differential to Italian domination in graphs (Q2238746) (← links)
- Vertices belonging to all or to no minimum vertex-edge dominating sets in trees (Q2244696) (← 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)
- Semitotal domination subdivision numbers of graphs (Q5034578) (← links)
- Edges contained in all or in no minimum edge dominating set of a tree (Q5197545) (← links)
- Semitotal domination in claw-free cubic graphs (Q5892260) (← links)
- Semitotal domination number of some graph operations (Q6064552) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)