Pages that link to "Item:Q2870942"
From MaRDI portal
The following pages link to A note on the number of dominating sets of a graph (Q2870942):
Displaying 14 items.
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- A note on the k-domination number of a graph (Q919005) (← links)
- Graphs with few total dominating sets (Q1699541) (← links)
- The average order of dominating sets of a graph (Q2231709) (← links)
- Trees with extremal numbers of \(k\)-dominating sets (Q2237230) (← links)
- Toward a Nordhaus-Gaddum inequality for the number of dominating sets (Q2278638) (← links)
- Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699) (← links)
- On the number of minimum dominating sets in trees (Q2699794) (← links)
- A note on the domination number of a graph and its complement (Q2760899) (← links)
- Dominating Set Counting in Graph Classes (Q3087935) (← links)
- (Q3620551) (← links)
- Note on the domination unmber of a graph (Q4274504) (← links)
- A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
- On the number of independent and \(k\)-dominating sets in graphs with average vertex degree at most \(k\) (Q6492379) (← links)