Locating-domination and identifying codes in trees
From MaRDI portal
Recommendations
Cited in
(45)- Bounds on the locating Roman domination number in trees
- Bounds on the locating-domination number and differentiating-total domination number in trees
- Operads of finite posets
- On the minimum size of an identifying code over all orientations of a graph
- Identifying and locating-dominating codes on chains and cycles
- Bounds on the identifying codes in trees
- Locating-dominating sets: from graphs to oriented graphs
- Identifying codes in the complementary prism of cycles
- On connected 3-\(\gamma_L\)-dot-critical graphs
- Linear-time algorithms for three domination-based separation problems in block graphs
- On trees with unique locating kernels
- Locating-dominating codes in paths
- Locating-total domination in grid graphs
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Locating domination in bipartite graphs and their complements
- Optimal locating-total dominating sets in strips of height 3
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- LD-graphs and global location-domination in bipartite graphs
- A sharp lower bound for locating-dominating sets in trees
- Locating-total dominating sets in twin-free graphs: a conjecture
- Location-domination in line graphs
- Locating-domination and identification
- Vertices belonging to all or to no minimum locating dominating sets of trees
- Domination and location in acyclic graphs
- Locating-total domination in graphs
- Locating-total domination in claw-free cubic graphs
- scientific article; zbMATH DE number 2147927 (Why is no real title available?)
- The geodetic domination number of comb product graphs
- Open-independent, open-locating-dominating sets
- Revisiting and improving upper bounds for identifying codes
- scientific article; zbMATH DE number 2192146 (Why is no real title available?)
- Sharp bound on the truncated metric dimension of trees
- \( [ 1 , 2 ]\)-dimension of graphs
- Open neighborhood locating-dominating in trees
- Progress towards the two-thirds conjecture on locating-total dominating sets
- The perfect locating signed Roman domination of some graphs
- A characterization of graphs with upper locating-domination number equal to n - 2
- Identifying codes in graphs of given maximum degree: characterizing trees
- The vertex-edge locating Roman domination of some graphs
- Locating fair domination in graphs
- Independent location-domination number of graphs
- Fault tolerant detectors for distinguishing sets in graphs
- Locating-dominating codes: bounds and extremal cardinalities
- Minimal identifying codes in trees and planar graphs with large girth
This page was built for publication: Locating-domination and identifying codes in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442540)
