On the total restrained domination edge critical graphs

zbMATH Open1289.05352MaRDI QIDQ5397262FDOQ5397262

Authors: K. M. Koh, Zeinab Maleki, Benhaz Omoomi 

Publication date: 19 February 2014

Recommendations

• On the total restrained domination number of a graph
• Results on total restrained domination in graphs
• Total restrained domination in trees
• Total restrained domination in graphs
• Total restrained domination numbers of trees

zbMATH Keywords

treematchingedge covertotal restrained domination numbertotal restrained domination edge critical graphs

Mathematics Subject Classification ID

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

Cited In (7)

• Results on total restrained domination in graphs
• Vertex and edge critical total restrained domination in graphs
• On the total restrained domination number of a graph
• Matchings in \(4\)-total restrained domination vertex critical graphs.
• Characterization of total restrained domination edge critical unicyclic graphs
• An upper bound for the total restrained domination number of graphs
• An upper bound on the total restrained domination number of a tree

This page was built for publication: On the total restrained domination edge critical graphs

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