scientific article; zbMATH DE number 2094533
From MaRDI portal
Publication:4812925
zbMath1051.05065MaRDI QIDQ4812925
E. J. Cockayne, Odile Favaron, Christina M. Mynhardt
Publication date: 23 August 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
Weak Roman domination in rooted product graphs ⋮ Changing and unchanging in \(m\)-eternal total domination in graphs ⋮ Upper secure domination number of a graph ⋮ Total protection of lexicographic product graphs ⋮ Further results on secure restrained domination in graphs ⋮ Irredundance, secure domination and maximum degree in trees ⋮ Protection of graphs with emphasis on Cartesian product graphs ⋮ On the strong Roman domination number of graphs ⋮ Roman domination on strongly chordal graphs ⋮ Exact algorithms for weak Roman domination ⋮ Secure vertex cover of a graph ⋮ Global secure sets of grid-like graphs ⋮ Tight bounds for eternal dominating sets in graphs ⋮ Secure equitability in graphs ⋮ On the global Roman domination number in graphs ⋮ A note on secure domination in \(C_5\)-free graphs ⋮ A linear algorithm for secure domination in trees ⋮ 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 ⋮ Edge criticality in secure graph domination ⋮ Secure domination in rooted product graphs ⋮ Secure Italian domination in graphs ⋮ The complexity of the defensive domination problem in special graph classes ⋮ Secure restrained domination in graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Eternal and Secure Domination in Graphs ⋮ SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS ⋮ m-Eternal total domination in graphs ⋮ Protection of lexicographic product graphs ⋮ On minimum secure dominating sets of graphs ⋮ On secure domination in trees ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ Secure domination critical graphs ⋮ Co-Roman domination in graphs ⋮ On secure domination in graphs
This page was built for publication:
