On the secure-domination number of the full balanced binary tree

MaRDI QIDQ2960922zbMATH OpenFDO

Authors John D. Weeks, P. D. jun. Johnson

Publication date 17 February 2017

Full work available at URL http://ijmcs.future-in-tech.net/11.2/R-Weeks.pdf

zbMATH Keywords

dominating setbinary treeattackdefensesecure setsecure-domination number

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On secure domination in graphs
• On secure domination in trees
• scientific article; zbMATH DE number 2188623
• Note on the secure-domination number of a graph
• On computing secure domination of trees

Cited in

(1)

• Note on the secure-domination number of a graph

This page was built for publication: On the secure-domination number of the full balanced binary tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960922)