Pages that link to "Item:Q2331584"

The following pages link to A new lower bound on the domination number of a graph (Q2331584):

Displaying 16 items.

• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496) (← links)
• Improved bounds on the domination number of a tree (Q406327) (← links)
• A new lower bound on the double domination number of a graph (Q1720339) (← links)
• The limit case of a domination property (Q1758000) (← links)
• A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
• A classification of cactus graphs according to their domination number (Q2118249) (← links)
• A classification of cactus graphs according to their total domination number (Q2305640) (← links)
• Lower bounds for the domination number (Q2997606) (← links)
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH (Q3677800) (← links)
• (Q3752410) (← links)
• The forcing nonsplit domination number of a graph (Q5006062) (← links)
• Upper paired domination versus upper domination (Q5024681) (← links)
• The edge-to-edge geodetic domination number of a graph (Q5027740) (← links)
• A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
• A new lower bound on the total domination number of a graph (Q5880783) (← links)
• Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)