A note on Nordhaus-Gaddum inequalities for domination.

DOI10.1016/S0166-218X(03)00200-2zbMath1035.05067MaRDI QIDQ1421486

Erfang Shan, Chuangyin Dang, Li-ying Kang

Publication date: 26 January 2004

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

zbMATH Keywords

DominationTotal dominationDouble domination

Mathematics Subject Classification ID

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

Related Items (13)

3-factor-criticality in double domination edge critical graphs ⋮ Nordhaus-Gaddum type result for the matching number of a graph ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Monochromatic disconnection 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 ⋮ Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ Multiple Domination ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

Cites Work

• Nordhaus-Gaddum inequalities for domination in graphs
• On Complementary Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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