Pages that link to "Item:Q5249240"
From MaRDI portal
The following pages link to Graphs with Large Disjunctive Total Domination Number (Q5249240):
Displaying 11 items.
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Bounds on the disjunctive total domination number of a tree (Q907839) (← links)
- Complexity and bounds for disjunctive total bondage (Q2661777) (← links)
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- The disjunctive domination number of a graph (Q2968643) (← links)
- Disjunctive total domination stability in graphs (Q5004430) (← links)
- On disjunctive domination in graphs (Q5221839) (← links)
- A constructive characterization of trees with equal total domination and disjunctive domination numbers (Q5233942) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Analysis of Vulnerability of Some Transformation Networks (Q6169956) (← links)