Pages that link to "Item:Q2331584"

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

Displaying 7 items.

• 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)
• 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)
• Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)