Open neighborhood locating-dominating in trees
From MaRDI portal
Publication:628345
DOI10.1016/J.DAM.2010.12.010zbMATH Open1209.05053OpenAlexW2068262188MaRDI QIDQ628345FDOQ628345
Authors: Suk J. Seo, Peter Slater 
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
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Locating-domination and identifying codes in trees
- Two-Processor Scheduling with Start-Times and Deadlines
- Title not available (Why is that?)
- Locating and total dominating sets in trees
- Title not available (Why is that?)
- Domination and location in acyclic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algorithm for a core of a tree
- New bounds for codes identifying vertices in graphs
- Bounds on identifying codes
- Fault-tolerant locating-dominating sets
- On strongly identifying codes
- Title not available (Why is that?)
Cited In (24)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Title not available (Why is that?)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Identification of points using disks
- Locating-dominating codes: bounds and extremal cardinalities
- Extremal cubic graphs for fault-tolerant locating domination
- Progress on fault-tolerant locating-dominating sets
- Set graphs. II. Complexity of set graph recognition and similar problems
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Fault tolerant detectors for distinguishing sets in graphs
- Open-independent, open-locating-dominating sets
- The open-locating-dominating number of some convex polytopes
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Characterizing extremal graphs for open neighbourhood location-domination
- Title not available (Why is that?)
- On the binary locating-domination number of regular and strongly-regular graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Algorithmic aspects of open neighborhood location-domination in graphs
- Separating Codes and Traffic Monitoring
- My Favorite Domination Conjectures in Graph Theory Are Bounded
- Optimal open-locating-dominating sets in infinite triangular grids
- The binary locating-dominating number of some convex polytopes
- Separating codes and traffic monitoring
- Bounding the trace function of a hypergraph with applications
This page was built for publication: Open neighborhood locating-dominating in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628345)
