Pages that link to "Item:Q3196396"
From MaRDI portal
The following pages link to Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396):
Displaying 7 items.
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
- Relating domination, exponential domination, and porous exponential domination (Q1751208) (← links)
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- On disjunctive domination in graphs (Q5221839) (← links)
- Dierentiating-Dominating sets in graphs Under binary operations (Q5263321) (← links)