Restrained domination in claw-free graphs with minimum degree at least two

DOI10.1007/s00373-010-0883-3zbMath1205.05167OpenAlexW2031319443MaRDI QIDQ968212

Ernst J. Joubert, Johannes H. Hattingh

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0883-3

zbMATH Keywords

graphupper boundclaw-free graphdominationrestrained dominationorder of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

NP-completeness and APX-completeness of restrained domination in graphs ⋮ Restrained and Total Restrained Domination in Graphs ⋮ A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the total restrained domination number of a tree
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• 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

This page was built for publication: Restrained domination in claw-free graphs with minimum degree at least two