Nordhaus-Gaddum inequalities for domination in graphs
From MaRDI portal
Publication:1923485
DOI10.1016/0012-365X(94)00373-QzbMath0856.05053OpenAlexW1983373780MaRDI QIDQ1923485
Frank Harary, Teresa W. Haynes
Publication date: 17 February 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00373-q
Related Items (40)
A note on the k-tuple domination number of graphs ⋮ Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ More on the rainbow disconnection in graphs ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Nordhaus-Gaddum-type theorem for rainbow connection number of graphs ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Domination in 4-regular graphs with girth 3 ⋮ Nordhaus--Gaddum bounds for independent domination ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum bounds for total domination ⋮ On the complexity of the labeled domination problem in graphs ⋮ Monochromatic disconnection of graphs ⋮ Nordhaus-Gaddum-type theorem for total-proper connection number of graphs ⋮ A note on Nordhaus-Gaddum inequalities for domination. ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ The upper bound on \(k\)-tuple domination numbers of graphs ⋮ On conflict-free connection of graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Total domination and total domination subdivision number of a graph and its complement ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ On rainbow total-coloring of a graph ⋮ A generalised upper bound for the \(k\)-tuple domination number ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ The \(k\)-tuple domination number revisited ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ The (vertex-)monochromatic index of a graph ⋮ Toward a Nordhaus-Gaddum inequality for the number of dominating sets ⋮ Proper connection numbers of complementary graphs ⋮ A note on double domination in graphs ⋮ \(k\)-tuple domination in graphs ⋮ Multiple Domination ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs ⋮ Signed domination numbers of a graph and its complement ⋮ Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
Cites Work
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On connected cutfree domination in graphs
- Parallel concepts in graph theory
- On Complementary Graphs
- Vertex domination-critical graphs
- Total domination in graphs
- Towards a theory of domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nordhaus-Gaddum inequalities for domination in graphs
