Paired-domination number of a graph and its complement

DOI10.1016/J.DISC.2007.11.034zbMATH Open1181.05067OpenAlexW1982249589MaRDI QIDQ998404FDOQ998404

Authors: Odile Favaron, Hossein Karami, Seyed Mahmood Sheikholeslami 

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.034

Recommendations

• Bounds on the paired domination number of graphs with minimum degree at least three
• Graphs with large paired-domination number
• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Upper bounds on the paired-domination number
• The paired-domination and the upper paired-domination numbers of graphs

zbMATH Keywords

paired-domination numberNordhaus-Gaddum inequalities

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Paired-domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with large paired-domination number
• Title not available (Why is that?)
• Some upper bounds for the domination number

Cited In (8)

• Graphs with maximum size and given paired-domination number
• A proof of a conjecture on the paired-domination subdivision number
• An upper bound on the paired-domination number in terms of the number of edges in the graph
• Title not available (Why is that?)
• Paired domination in graphs
• Paired-domination subdivision numbers of graphs
• Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
• Cubic graphs have paired-domination number at most four-seventh of their orders

This page was built for publication: Paired-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 Q998404)