Pages that link to "Item:Q1923485"

The following pages link to Nordhaus-Gaddum inequalities for domination in graphs (Q1923485):

Displaying 41 items.

• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
• Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
• On rainbow total-coloring of a graph (Q494442) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
• Proper connection numbers of complementary graphs (Q723592) (← links)
• Domination in 4-regular graphs with girth 3 (Q893494) (← links)
• The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
• Total domination and total domination subdivision number of a graph and its complement (Q932661) (← links)
• The \(k\)-tuple domination number revisited (Q952712) (← links)
• \(k\)-tuple domination in graphs (Q1014390) (← links)
• On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
• Nordhaus--Gaddum bounds for independent domination (Q1398273) (← links)
• A note on Nordhaus-Gaddum inequalities for domination. (Q1421486) (← links)
• Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
• Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
• On conflict-free connection of graphs (Q1727736) (← links)
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
• Signed domination numbers of a graph and its complement (Q1827775) (← links)
• The (vertex-)monochromatic index of a graph (Q2012896) (← links)
• A note on double domination in graphs (Q2030253) (← links)
• More on the rainbow disconnection in graphs (Q2158198) (← links)
• Monochromatic disconnection of graphs (Q2208356) (← links)
• Toward a Nordhaus-Gaddum inequality for the number of dominating sets (Q2278638) (← links)
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← links)
• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136) (← links)
• The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
• Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
• Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
• Nordhaus-Gaddum results for the convex domination number of a graph (Q2454593) (← links)
• A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
• On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
• Multiple Domination (Q3384609) (← links)
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS (Q3575371) (← links)
• A note on the k-tuple domination number of graphs (Q5037921) (← links)
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
• Nordhaus-Gaddum bounds for upper total domination (Q5089900) (← links)
• From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
• The extended dominating sets in graphs (Q6542990) (← links)