Pages that link to "Item:Q3073450"
From MaRDI portal
The following pages link to A bound on the k-domination number of a graph (Q3073450):
Displaying 13 items.
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
- Bounds on the \(k\)-domination number of a graph (Q2430065) (← links)
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number (Q2442219) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- Dominating sets inducing large components (Q2629281) (← links)
- On the \(k\)-domination number, the domination number and the cycle of length four (Q2811813) (← links)
- Bounds on the upper \(k\)-domination number and the upper \(k\)-star-forming number of a graph (Q2895350) (← links)
- Multiple Domination (Q3384609) (← links)
- Onk-domination and minimum degree in graphs (Q3539928) (← links)
- An upper bound for thek-domination number of a graph (Q3815347) (← links)
- (Q5463559) (← links)