Connected eternal domination in graphs

MaRDI QIDQ5411368zbMATH OpenFDO

Authors K. Reji Kumar, E. N. Satheesh

Publication date 23 April 2014

Full work available at URL http://www.pphmj.com/abstract/7062.htm

zbMATH Keywords

eternal \(m\)-secure seteternal 1-secure setconnected eternal \(m\)-secure setconnected eternal \(m\)-security number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2174620
• Eternal m-security in certain classes of graphs
• Changing and unchanging in m-eternal total domination in graphs
• Eternal m-security bondage numbers in graphs
• Eternal total domination in graphs.

Cited in

(11)

• Eternal m-security subdivision numbers in graphs
• Eternally secure sets, independence sets and cliques
• Eternal total domination in graphs.
• Eternal and Secure Domination in Graphs
• Tight bounds for eternal dominating sets in graphs
• Changing and unchanging in m-eternal total domination in graphs
• Eternal m-security bondage numbers in graphs
• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• Eternal domination: criticality and reachability
• Eternal domination on prisms of graphs
• Eternal m-security in certain classes of graphs

This page was built for publication: Connected eternal domination in graphs

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