Pages that link to "Item:Q3786298"
From MaRDI portal
The following pages link to Domination and location in acyclic graphs (Q3786298):
Displaying 49 items.
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- The number of completely different optimal identifying codes in the infinite square grid (Q2410258) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Locating and total dominating sets in trees (Q2495911) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- On fractional metric dimension of graphs (Q2874052) (← links)
- Landmarks in binary tree derived architectures. (Q2918647) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- Liar's domination (Q3057104) (← links)
- Location-2-Domination for Product of Graphs (Q3296833) (← links)
- Local Distance Pattern Distinguishing Sets in Graphs (Q3296834) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- (Q3684148) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Varieties of Roman domination II (Q4956207) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- The open-locating-dominating number of some convex polytopes (Q5014387) (← links)
- Location domination number of line graph (Q5036678) (← links)
- Fractional metric dimension of generalized prism graph (Q5039459) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- Structural characterization of some family of local distance pattern distinguishing graphs (Q5059599) (← links)
- (Q5074499) (← links)
- The adjacency dimension of graphs (Q5089704) (← links)
- On resolvability of a graph associated to a finite vector space (Q5377480) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- (Q5889911) (← links)
- Sequential metric dimension (Q5918179) (← links)
- Sharp bound on the truncated metric dimension of trees (Q6041544) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters (Q6072291) (← links)
- The dominating partition dimension and locating-chromatic number of graphs (Q6090326) (← links)
- \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)
- Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
- Fractional local edge dimensions of a graph (Q6560774) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph (Q6644885) (← links)
- A note on locating-dominating sets in twin-free graphs (Q6646416) (← links)
- An extension of locating-total domination problem and its complexity (Q6652677) (← links)
- Optimal error-detection system for identifying codes (Q6663966) (← links)