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

DOI10.1007/S00373-010-0883-3MaRDI QIDQ968212zbMATH OpenOpenAlexFDO

Authors Johannes H. Hattingh, Ernst J. Joubert

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

graphclaw-free graphdominationupper boundrestrained 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)

Recommendations

• Total restrained domination in claw-free graphs with minimum degree at least two
• 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 with minimum degree two
• Total restrained domination in claw-free graphs
• Restrained domination in cubic graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A note on restrained domination in trees.
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
• An upper bound on the total restrained domination number of a tree
• Graphs with large restrained domination number
• Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
• On equality in an upper bound for the restrained and total domination numbers of a graph
• On total restrained domination in graphs
• Restrained domination excellent trees.
• Restrained domination in graphs
• Restrained domination in graphs with minimum degree two
• Restrained domination in trees
• Trees with equal domination and restrained domination numbers

Cited in

(9)

• Total restrained domination in claw-free graphs
• Claw-free graphs with equal 2-domination and domination numbers
• Total restrained domination in claw-free graphs with minimum degree at least two
• Restrained domination in cubic graphs
• NP-completeness and APX-completeness of restrained domination in graphs
• Restrained and total restrained domination in graphs
• scientific article; zbMATH DE number 1416471 (Why is no real title available?)
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968212)