scientific article; zbMATH DE number 5492394

zbMath1183.05055MaRDI QIDQ5503336

E. J. Cockayne, Christina M. Mynhardt, Stephen Benecke

Publication date: 15 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

protection of a graphsecure total domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

Algorithmic results in secure total dominating sets on graphs ⋮ Total protection of lexicographic product graphs ⋮ Secure vertex cover of a graph ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ Secure connected domination and secure total domination in unit disk graphs and rectangle graphs ⋮ From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs ⋮ Secure total domination in graphs: bounds and complexity ⋮ Secure total domination in chain graphs and cographs ⋮ Eternal and Secure Domination in Graphs ⋮ CONNECTED SUPER DOMINATION IN GRAPHS ⋮ FORCING SUPER DOMINATION NUMBER OF A GRAPH ⋮ SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS ⋮ On secure domination in graphs

This page was built for publication: