Open neighborhood locating-dominating in trees

DOI10.1016/j.dam.2010.12.010zbMath1209.05053OpenAlexW2068262188MaRDI QIDQ628345

Peter J. Slater, Suk J. Seo

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.010

zbMATH Keywords

dominationopen neighborhood locating-dominating set

Mathematics Subject Classification ID

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

Related Items (23)

Identification of points using disks ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Progress on fault-tolerant locating-dominating sets ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ The binary locating-dominating number of some convex polytopes ⋮ Separating codes and traffic monitoring ⋮ Unnamed Item ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs ⋮ Separating Codes and Traffic Monitoring ⋮ Bounding the trace function of a hypergraph with applications ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ The open-locating-dominating number of some convex polytopes ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs ⋮ Optimal open-locating-dominating sets in infinite triangular grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for codes identifying vertices in graphs
• Fault-tolerant locating-dominating sets
• On strongly identifying codes
• Locating and total dominating sets in trees
• Domination and location in acyclic graphs
• A linear algorithm for a core of a tree
• Two-Processor Scheduling with Start-Times and Deadlines
• On a new class of codes for identifying vertices in graphs
• Bounds on identifying codes

This page was built for publication: Open neighborhood locating-dominating in trees