Restrained double domination number of a graph

MaRDI QIDQ950665zbMATHFDO

Authors B. E. Eshmatov

Publication date 3 November 2008

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

restrained dominationdouble dominationNordhaus-Gaddum resultrestrained double domination number

Mathematics Subject Classification ID

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

Recommendations

• Restrained domination in graphs with minimum degree two
• Restrained double Roman domination of a graph
• Further results on secure restrained domination in graphs
• An upper bound on the restrained domination number of graphs.
• All graphs with restrained domination number three less than their order

Cited in

(7)

• scientific article; zbMATH DE number 5635305 (Why is no real title available?)
• A NOTE ON SOME DOMINATION OF FUZZY GRAPHS
• Restrained {2}-domination in graphs
• Restrained and total restrained domination in graphs
• Restrained double Roman domination of a graph
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Degree equitable restrained double domination in graphs

This page was built for publication: Restrained double domination number of a graph

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