Pages that link to "Item:Q1010625"

The following pages link to A new upper bound on the total domination number of a graph (Q1010625):

Displaying 16 items.

• Matchings, path covers and domination (Q329554) (← links)
• A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture (Q400496) (← links)
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
• More on limited packings in graphs (Q782753) (← links)
• A survey of selected recent results on total domination in graphs (Q998491) (← links)
• Essential upper bounds on the total domination number (Q1752594) (← links)
• Total domination and the Caccetta-Häggkvist conjecture (Q1926487) (← links)
• A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
• Relating the total domination number and the annihilation number for quasi-trees and some composite graphs (Q2144511) (← links)
• On the forcing domination and the forcing total domination numbers of a graph (Q2165253) (← links)
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles (Q3605160) (← links)
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH (Q3677800) (← links)
• An upper bound on the domination number of a graph. (Q3812287) (← links)
• An upper bound for thek-domination number of a graph (Q3815347) (← links)
• Some new results on the total domination polynomial of a graph (Q5016055) (← links)
• A new lower bound on the total domination number of a graph (Q5880783) (← links)