scientific article; zbMATH DE number 2188623
From MaRDI portal
Publication:5461705
zbMath1071.05058MaRDI QIDQ5461705
Elna Ungerer, Henda C. Swart, Christina M. Mynhardt
Publication date: 26 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Complexity issues of perfect secure domination in graphs ⋮ Upper secure domination number of a graph ⋮ Further results on secure restrained domination in graphs ⋮ Irredundance, secure domination and maximum degree in trees ⋮ \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent ⋮ Secure vertex cover of a graph ⋮ Secure equitability in graphs ⋮ The complexity of secure domination problem in graphs ⋮ Unnamed Item ⋮ A linear algorithm for secure domination in trees ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ Edge criticality in secure graph domination ⋮ Secure restrained domination in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ m-Eternal total domination in graphs ⋮ On minimum secure dominating sets of graphs ⋮ On secure domination in trees ⋮ Secure domination critical graphs ⋮ On weakly connected domination in graphs. II. ⋮ Co-Roman domination in graphs ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ On secure domination in graphs
This page was built for publication:
