Connected eternal domination in graphs
From MaRDI portal
Publication:5411368
zbMATH Open1286.05124MaRDI QIDQ5411368FDOQ5411368
Authors: K. Reji Kumar, E. N. Satheesh
Publication date: 23 April 2014
Full work available at URL: http://www.pphmj.com/abstract/7062.htm
Recommendations
eternal \(m\)-secure seteternal 1-secure setconnected eternal \(m\)-secure setconnected eternal \(m\)-security number
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (11)
- 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
- Title not available (Why is that?)
- Eternal domination: criticality and reachability
- Eternal domination on prisms of graphs
- Eternal \(m\)-security in certain classes of graphs
- Eternal \(m\)-security subdivision numbers in 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)