Equality in a bound that relates the size and the restrained domination number of a graph

DOI10.1007/s10878-015-9843-4zbMath1368.90161OpenAlexW1983066952MaRDI QIDQ281803

Ernst J. Joubert, Johannes H. Hattingh

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9843-4

zbMATH Keywords

graphsizeorderdominationrestrained domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Restrained domination in self-complementary graphs ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Restrained domination in graphs
• Maximum sizes of graphs with given domination parameters
• Maximum sizes of graphs with given restrained domination numbers
• 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
• Remarks on restrained domination and total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equality in a bound that relates the size and the restrained domination number of a graph