Pages that link to "Item:Q1378519"

The following pages link to Tight upper bounds for the domination numbers of graphs with given order and minimum degree (Q1378519):

Displaying 15 items.

• Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
• Remoteness of permutation codes (Q427818) (← links)
• On the domination number of Hamiltonian graphs with minimum degree six (Q952720) (← links)
• Domination, radius, and minimum degree (Q967345) (← links)
• A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II (Q1589861) (← links)
• The incidence coloring conjecture for graphs of maximum degree 3 (Q1773364) (← links)
• Factor domination and minimum degree (Q1868841) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
• Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
• Domination in graphs of minimum degree five (Q2494122) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• On \(n\)-total domination number in graphs (Q3976627) (← links)
• (Q4470232) (← links)