Pages that link to "Item:Q2427506"
From MaRDI portal
The following pages link to Distance paired domination numbers of graphs (Q2427506):
Displaying 13 items.
- 2-distance paired-dominating number of graphs (Q489733) (← links)
- On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) (Q491215) (← links)
- On the distance paired-domination of circulant graphs (Q624866) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- Graphs having distance-\(n\) domination number half their order (Q1613368) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Distance-2 domatic numbers of grid graphs (Q2799858) (← links)
- A general method in the theory of domination in graphs (Q3066944) (← links)
- DISTANCE-k TOTAL DOMINATION POLYNOMIAL OF SOME GRAPHS (Q4639460) (← links)
- (Q4848783) (← links)
- On the distance domination number of bipartite graphs (Q4958000) (← links)