Pages that link to "Item:Q423952"

The following pages link to On graphs for which the connected domination number is at most the total domination number (Q423952):

Displayed 4 items.

• The price of connectivity for dominating set: upper bounds and complexity (Q406321) ‎ (← links)
• On a class of graphs between threshold and total domishold graphs (Q496435) ‎ (← links)
• Domination parameters of a graph and its complement (Q1692643) ‎ (← links)
• Bounds on the connected domination number of a graph (Q2446883) ‎ (← links)