Pages that link to "Item:Q5950386"
From MaRDI portal
The following pages link to On the domination number of a random graph (Q5950386):
Displaying 20 items.
- Bounds on the maximum number of minimum dominating sets (Q271624) (← links)
- The bondage number of random graphs (Q281604) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Onk-tuple domination of random graphs (Q735107) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Sharp concentration of hitting size for random set systems (Q2345531) (← links)
- Graphs with diameter 2 and large total domination number (Q2657085) (← links)
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph (Q2689447) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- The 2-tuple dominating independent number of a random graph (Q3303532) (← links)
- Vertex Pursuit Games in Stochastic Network Models (Q5458505) (← links)
- On the Concentration of the Domination Number of the Random Graph (Q5499732) (← links)
- Connected domination in random graphs (Q6107484) (← links)
- Robust domination in random graphs (Q6572364) (← links)
