scientific article; zbMATH DE number 2188604
From MaRDI portal
Publication:5461685
zbMath1081.05083MaRDI QIDQ5461685
Jan H. van Vuuren, E. J. Cockayne, W. R. Gründlingh, P. J. P. Grobler, Justin Manango W. Munganga
Publication date: 26 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (73)
Complexity issues of perfect secure domination in graphs ⋮ An improved binary programming formulation for the secure domination problem ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Algorithmic results in secure total dominating sets on graphs ⋮ Weak Roman domination in rooted product graphs ⋮ Weak Roman subdivision number of graphs ⋮ Changing and unchanging in \(m\)-eternal total domination in graphs ⋮ Upper secure domination number of a graph ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Total protection of lexicographic product graphs ⋮ Further results on secure restrained domination in graphs ⋮ Irredundance, secure domination and maximum degree in trees ⋮ SECURE DOMINATION COVER PEBBLING NUMBER FOR VARIANTS OF COMPLETE GRAPHS ⋮ SECURE DOMINATING SETS AND SECURE DOMINATION POLYNOMIALS OF CYCLES ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ Secure domination in proper interval graphs ⋮ Roman domination on strongly chordal graphs ⋮ Complexity issues of variants of secure domination in graphs ⋮ Exact algorithms for weak Roman domination ⋮ Secure domination in cographs ⋮ Secure vertex cover of a graph ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Secure domination of some graph operators ⋮ The Outer-Paired Domination of Graphs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Complexity results on cosecure domination in graphs ⋮ Security in Sierpiński graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Cosecure domination: hardness results and algorithms ⋮ Algorithmic aspects of secure domination in unit disk graphs ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ On the complexity of co-secure dominating set problem ⋮ On computing a minimum secure dominating set in block graphs ⋮ The complexity of secure domination problem in graphs ⋮ A note on secure domination in \(C_5\)-free graphs ⋮ Secure connected domination and secure total domination in unit disk graphs and rectangle graphs ⋮ Signed Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Roman domination in graphs. ⋮ A linear algorithm for secure domination in trees ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ The secure domination problem in cographs ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ Roman dominating influence parameters ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ m-Secure vertex cover of a graph ⋮ Edge criticality in secure graph domination ⋮ Secure domination in rooted product graphs ⋮ Secure Italian domination in graphs ⋮ The roman domatic number of a graph ⋮ Secure total domination in graphs: bounds and complexity ⋮ Secure total domination in chain graphs and cographs ⋮ Algorithmic complexity of secure connected domination in graphs ⋮ The cost of edge removal in graph domination ⋮ Secure restrained domination in graphs ⋮ Algorithmic aspects of secure connected domination in graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Secure domination subdivision number of a graph ⋮ Roman Domination in Graphs ⋮ Eternal and Secure Domination in Graphs ⋮ m-Eternal total domination in graphs ⋮ Guarding a subgraph as a tool in pursuit-evasion games ⋮ Protection of lexicographic product graphs ⋮ The secure domination number of Cartesian products of small graphs with paths and cycles ⋮ On minimum secure dominating sets of graphs ⋮ On secure domination in trees ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set ⋮ Secure domination critical graphs ⋮ Co-Roman domination in graphs ⋮ On secure domination in graphs ⋮ On computing secure domination of trees
This page was built for publication:
