Restrained double domination number of a graph

zbMATH Open1169.05363MaRDI QIDQ950665FDOQ950665

Authors: B. E. Eshmatov 

Publication date: 3 November 2008

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

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

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)

Cited In (7)

• Restrained {2}-domination in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A NOTE ON SOME DOMINATION OF FUZZY GRAPHS
• Title not available (Why is that?)
• Restrained double Roman domination of a graph
• Degree equitable restrained double domination in graphs
• Restrained and Total Restrained 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)