Pages that link to "Item:Q292247"
From MaRDI portal
The following pages link to Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247):
Displaying 12 items.
- How long can one bluff in the domination game? (Q521751) (← links)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- On the domination number of graphs with minimum degree six (Q2032873) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- On the structure of dominating graphs (Q2409507) (← links)
- Domination number of graphs with minimum degree five (Q2656332) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- On domination-type invariants of Fibonacci cubes and hypercubes (Q4577877) (← links)
- Total double Roman domination in graphs (Q5212897) (← links)
