Connected domination number of a graph and its complement

DOI10.1007/S00373-011-1028-ZMaRDI QIDQ659759zbMATH OpenOpenAlexFDO

Authors Hossein Karami, Seyed Mahmood Sheikholeslami, Abdollah Khodkar, Douglas B. West

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)

Recommendations

• Nordhaus-Gaddum type results for connected and total domination
• An inequality on connected domination parameters
• On connected k-domination numbers of graphs.
• scientific article; zbMATH DE number 1135751
• scientific article; zbMATH DE number 637618

Cites work

• Connected Domination and Spanning Trees with Many Leaves
• scientific article; zbMATH DE number 3873384 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 2188609 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• On Complementary Graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning Trees with Many Leaves

Cited in

(26)

• The connectivity of a graph and its complement
• Domination parameters of a graph and its complement
• Nordhaus-Gaddum bounds for total Roman domination
• Connected domsaturation number of a graph
• Relating the size of a connected graph to its total and restricted domination numbers
• Connected domination in maximal outerplanar graphs
• Nordhaus-Gaddum bounds for total domination
• The product of the restrained domination numbers of a graph and its complement
• Traceability of connected domination critical graphs
• Connected domination
• Restrained and total restrained domination in graphs
• scientific article; zbMATH DE number 637618 (Why is no real title available?)
• scientific article; zbMATH DE number 6149602 (Why is no real title available?)
• Nordhaus-Gaddum type results for connected and total domination
• A polynomial time algorithm for geodetic hull number for complementary prisms
• [1,2]-Complementary connected domination number of graphs-III
• Partial domination -- the isolation number of a graph
• The product of the total restrained domination numbers of a graph and its complement
• scientific article; zbMATH DE number 6280453 (Why is no real title available?)
• scientific article; zbMATH DE number 6290680 (Why is no real title available?)
• Inequalities of Nordhaus-Gaddum type for doubly connected domination number
• Nordhaus-Gaddum-type results on the connected edge domination number
• Connected domination in graphs and v-numbers of binomial edge ideals
• Intrinsically knotted graphs and connected domination
• Connected domination versus dominating sets inducing large components
• Connected domination in plane triangulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659759)