A sharp lower bound for locating-dominating sets in trees

MaRDI QIDQ2938248zbMATH OpenFDO

Authors J. Louis Sewell, Peter Slater

Publication date 14 January 2015

Full work available at URL http://ajc.maths.uq.edu.au//pdf/60/ajc_v60_p136.pdf

zbMATH Keywords

locating-dominating set

Mathematics Subject Classification ID

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

Recommendations

• Bounds on the locating-total domination number in trees
• Bounds on the locating-total domination number of a tree
• A note on the locating-total domination in trees
• Locating-domination and identifying codes in trees
• On locating-domination in graphs

Cited in

(10)

• Bounds on the locating Roman domination number in trees
• Bounds on the locating-domination number and differentiating-total domination number in trees
• Bounds on the locating-total domination number in trees
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Locating and total dominating sets in trees
• Locating-domination and identification
• Open locating-dominating interpolation for trees
• Locating-domination and identifying codes in trees
• Sharp bound on the truncated metric dimension of trees
• On the density of (1, )-locating-dominating codes in the infinite square grid

This page was built for publication: A sharp lower bound for locating-dominating sets in trees

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