Pages that link to "Item:Q2968643"
From MaRDI portal
The following pages link to The disjunctive domination number of a graph (Q2968643):
Displaying 17 items.
- Disjunctive total domination in graphs (Q266033) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Bounds on the disjunctive total domination number of a tree (Q907839) (← links)
- Relating domination, exponential domination, and porous exponential domination (Q1751208) (← links)
- Domination versus disjunctive domination in trees (Q2341765) (← links)
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- Disjunctive total domination in permutation graphs (Q2966509) (← links)
- Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
- The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs (Q3467878) (← links)
- On disjunctive domination in graphs (Q5221839) (← links)
- Domination versus disjunctive domination in graphs (Q5233919) (← links)
- A constructive characterization of trees with equal total domination and disjunctive domination numbers (Q5233942) (← links)
- Total domination in digraphs (Q5236071) (← links)
- Disjunctive domination in graphs with minimum degree at least two (Q6041864) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)
- Analysis of Vulnerability of Some Transformation Networks (Q6169956) (← links)
