scientific article; zbMATH DE number 2114685
From MaRDI portal
Publication:4826280
zbMATH Open1052.05053MaRDI QIDQ4826280FDOQ4826280
Authors: A. P. Burger, E. J. Cockayne, W. R. Gründlingh, J. H. van Vuuren, W. Winterbach, Christina M. Mynhardt 
Publication date: 11 November 2004
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- On minimum secure dominating sets of graphs
- Independent protection in graphs
- Guard games on graphs: keep the intruder out!
- Roman \(\{2 \}\)-domination
- Edge criticality in secure graph domination
- Bounds on weak Roman and 2-rainbow domination numbers
- Secure domination critical graphs
- Roman domination on strongly chordal graphs
- A linear algorithm for secure domination in trees
- On computing a minimum secure dominating set in block graphs
- Secure total domination in graphs
- Eternal and Secure Domination in Graphs
- Tight bounds for eternal dominating sets in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Changing and unchanging in \(m\)-eternal total domination in graphs
- Upper secure domination number of a graph
- Irredundance, secure domination and maximum degree in trees
- Co-Roman domination in graphs
- Further results on secure restrained domination in graphs
- \(m\)-eternal total domination in graphs
- Secure restrained domination in graphs
- Protection of complete multipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826280)
