Connected domination number of a graph and its complement

DOI10.1007/s00373-011-1028-zzbMath1234.05176OpenAlexW2128854296MaRDI QIDQ659759

Douglas B. West, Abdollah Khodkar, Hossein Karami, Seyyed Mahmoud Sheikholeslami

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1028-z

zbMATH Keywords

connected dominating setconnected domination numberNordhaus-Gaddum inequalities

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ Traceability of connected domination critical graphs ⋮ Inequalities of Nordhaus-Gaddum type for doubly connected domination number ⋮ Connected domination in maximal outerplanar graphs ⋮ Domination parameters of a graph and its complement ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ The product of the restrained domination numbers of a graph and its complement ⋮ Partial domination - the isolation number of a graph ⋮ Unnamed Item ⋮ Connected Domination ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees in graphs of minimum degree 4 or 5
• On Complementary Graphs
• Spanning Trees with Many Leaves
• Connected Domination and Spanning Trees with Many Leaves

This page was built for publication: Connected domination number of a graph and its complement