OLD trees with maximum degree three

MaRDI QIDQ2878227zbMATH OpenFDO

Authors Suk J. Seo, Peter Slater

Publication date 28 August 2014

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

case analysisdistinguishing setidentifying codeopen-locating-dominating set

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Open locating-dominating interpolation for trees
• On open neighborhood locating-dominating in graphs
• Open neighborhood locating-dominating in trees
• Algorithmic aspects of open neighborhood location-domination in graphs
• scientific article; zbMATH DE number 1472093

Cited in

(6)

• Locating-domination and identification
• Open-independent, open-locating-dominating sets
• On open neighborhood locating-dominating in graphs
• Open locating-dominating interpolation for trees
• Open neighborhood locating-dominating in trees
• Fault tolerant detectors for distinguishing sets in graphs

This page was built for publication: OLD trees with maximum degree three

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