Pages that link to "Item:Q1720344"
From MaRDI portal
The following pages link to On the semitotal domination number of line graphs (Q1720344):
Displaying 10 items.
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- Mixed domination and 2-independence in trees (Q2132130) (← links)
- Trees with unique minimum semitotal dominating sets (Q2175800) (← links)
- Semitotal domination subdivision numbers of graphs (Q5034578) (← links)
- (Q5038382) (← links)
- Semitotal domination number of some graph operations (Q6064552) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← 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)
