Pages that link to "Item:Q602677"
From MaRDI portal
The following pages link to Disjoint dominating and total dominating sets in graphs (Q602677):
Displaying 17 items.
- Finding dominators via disjoint set union (Q396673) (← links)
- Graphs with disjoint dominating and paired-dominating sets (Q607427) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Haar null and non-dominating sets (Q2773245) (← links)
- The disjunctive domination number of a graph (Q2968643) (← links)
- (Q3615799) (← links)
- Disjunctive total domination stability in graphs (Q5004430) (← links)
- On disjunctive domination in graphs (Q5221839) (← links)
- A characterization of graphs with disjoint total dominating sets (Q5225045) (← links)
- Dierentiating-Dominating sets in graphs Under binary operations (Q5263321) (← links)
- Graphs with disjoint 2-dominating sets (Q5863482) (← links)
- Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237) (← links)
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6611090) (← links)