Pages that link to "Item:Q2703021"
From MaRDI portal
The following pages link to Dominating a Family of Graphs with Small Connected Subgraphs (Q2703021):
Displaying 12 items.
- Simultaneous domination in graphs (Q489305) (← links)
- Bounds on the connected \(k\)-domination number in graphs (Q608255) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
- Total \(k\)-domination in Cartesian product graphs (Q1705225) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- Graphs of Large Linear Size Are Antimagic (Q2800541) (← links)
- On the (M, D) number of a graph (Q3294993) (← links)
- Multiple Domination (Q3384609) (← links)
