Open neighborhood locating-dominating in trees
From MaRDI portal
(Redirected from Publication:628345)
Recommendations
Cites work
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 3906528 (Why is no real title available?)
- scientific article; zbMATH DE number 4053685 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 4103125 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 861343 (Why is no real title available?)
- scientific article; zbMATH DE number 861404 (Why is no real title available?)
- A linear algorithm for a core of a tree
- Bounds on identifying codes
- Domination and location in acyclic graphs
- Fault-tolerant locating-dominating sets
- Locating and total dominating sets in trees
- Locating-domination and identifying codes in trees
- New bounds for codes identifying vertices in graphs
- On a new class of codes for identifying vertices in graphs
- On strongly identifying codes
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(29)- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- Open neighborhood locating-domination for grid-like graphs
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Extremal cubic graphs for fault-tolerant locating domination
- OLD trees with maximum degree three
- Characterizing extremal graphs for open neighbourhood location-domination
- Algorithmic aspects of open neighborhood location-domination in graphs
- Fault tolerant detectors for distinguishing sets in graphs
- Open locating-dominating interpolation for trees
- My favorite domination conjectures in graph theory are bounded
- Progress on fault-tolerant locating-dominating sets
- Bounding the trace function of a hypergraph with applications
- Open locating-dominating sets in circulant graphs
- The binary locating-dominating number of some convex polytopes
- On the binary locating-domination number of regular and strongly-regular graphs
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Set graphs. II. Complexity of set graph recognition and similar problems
- Separating codes and traffic monitoring
- On open neighborhood locating-dominating in graphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Optimal open-locating-dominating sets in infinite triangular grids
- Identification of points using disks
- Locating-dominating codes: bounds and extremal cardinalities
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Separating codes and traffic monitoring
- Some results on the open locating-total domination number in graphs
- Open-independent, open-locating-dominating sets
- The open-locating-dominating number of some convex polytopes
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)
