The product of the restrained domination numbers of a graph and its complement

DOI10.1007/s10114-014-2492-1zbMath1288.05192OpenAlexW2045058795MaRDI QIDQ2452393

Ernst J. Joubert, Johannes H. Hattingh

Publication date: 3 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-2492-1

zbMATH Keywords

graphupper bounddominationrestrained dominationNordhaus-Gaddum

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected domination number of a graph and its complement
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• Restrained domination in graphs
• Restrained domination in trees
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On Complementary Graphs
• Remarks on restrained domination and total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees

This page was built for publication: The product of the restrained domination numbers of a graph and its complement