A note on Nordhaus-Gaddum inequalities for domination.

DOI10.1016/S0166-218X(03)00200-2zbMATH Open1035.05067MaRDI QIDQ1421486FDOQ1421486

Authors: Erfang Shan, Chuangyin Dang, Liying Kang 

Publication date: 26 January 2004

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

Recommendations

• Nordhaus-Gaddum inequalities for domination in graphs
• Nordhaus-Gaddum type inequalities on the total Italian domination number in graphs
• Nordhaus-Gaddum type results for connected and total domination
• A Nordhaus-Gaddum-type result for the 2-domination number
• Nordhaus-Gaddum type results for domination sums in graphs with minimum degree at least four, five or six

zbMATH Keywords

DominationTotal dominationDouble domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Complementary Graphs
• Nordhaus-Gaddum inequalities for domination in graphs

Cited In (21)

• Nordhaus-Gaddum type results for domination sums in graphs with minimum degree at least four, five or six
• A Nordhaus-Gaddum-type result for the 2-domination number
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
• Multiple factor Nordhaus-Gaddum type results for domination and total domination
• A note on the domination inequalities and their applications
• On Aubin-Lichnerowicz's estimate and domination inequality.
• Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs
• Nordhaus-Gaddum type results for connected and total domination
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
• Nordhaus-Gaddum bounds for domination sums of graphs with minimum degree at least two or three
• Total domination and total domination subdivision number of a graph and its complement
• On conflict-free connection of graphs
• Monochromatic disconnection of graphs
• Nordhaus-Gaddum relations for proximity and remoteness in graphs
• Title not available (Why is that?)
• Nordhaus-Gaddum bounds for total domination
• Nordhaus-Gaddum type result for the matching number of a graph
• Nordhaus-Gaddum type inequality for the fractional matching number of a graph
• Multiple domination
• 3-factor-criticality in double domination edge critical graphs

This page was built for publication: A note on Nordhaus-Gaddum inequalities for domination.

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