Pages that link to "Item:Q1589861"
From MaRDI portal
The following pages link to Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II (Q1589861):
Displaying 12 items.
- Bounds on the maximum number of minimum dominating sets (Q271624) (← links)
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree (Q1378519) (← links)
- On the domination number of graphs with minimum degree six (Q2032873) (← links)
- Domination ratio of a family of integer distance digraphs with arbitrary degree (Q2142680) (← links)
- Decreasing the maximum degree of a graph (Q2166269) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- MAXIMIN DEGREE DOMINATION NUMBER IN GRAPHS AND ITS CRITICAL ASPECTS (Q2962499) (← links)
- Onk-domination and minimum degree in graphs (Q3539928) (← links)
- The smallest order of a graph with domination number equal to two and with every vertex contained in a \(K_n\) (Q4873689) (← links)
- On Dominating Sets and Independent Sets of Graphs (Q4946835) (← links)
