Pages that link to "Item:Q298637"
From MaRDI portal
The following pages link to The difference between the metric dimension and the determining number of a graph (Q298637):
Displayed 20 items.
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees (Q2033923) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- On the robustness of the metric dimension of grid graphs to adding a single edge (Q2143039) (← links)
- On connected 3-\(\gamma_L\)-dot-critical graphs (Q2151487) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- The difference between several metric dimension graph invariants (Q2696607) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- My Favorite Domination Conjectures in Graph Theory Are Bounded (Q5506786) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)
- Locating-dominating sets in local tournaments (Q6162022) (← links)