Restrained domination in cubic graphs

DOI10.1007/S10878-009-9281-2zbMath1250.90101OpenAlexW2059358913MaRDI QIDQ719025

Johannes H. Hattingh, Ernst J. Joubert

Publication date: 27 September 2011

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9281-2

zbMATH Keywords

graphupper boundlower boundcubic graphdominationrestrained domination

Mathematics Subject Classification ID

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

Related Items (5)

Bounds on domination parameters in graphs: a brief survey ⋮ Further results on secure restrained domination in graphs ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ Secure restrained domination in graphs ⋮ Restrained and Total Restrained Domination in Graphs

Cites Work

• Total restrained domination in cubic graphs
• Graphs with large restrained domination number
• 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
• Trees with equal domination and restrained domination numbers
• On total restrained domination in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Restrained domination in cubic graphs