The following pages link to (Q5442540):
Displayed 30 items.
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Locating-total domination in graphs (Q442212) (← links)
- Locating-total domination in claw-free cubic graphs (Q456648) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Bounds on the locating Roman domination number in trees (Q1692624) (← links)
- Bounds on the locating-domination number and differentiating-total domination number in trees (Q1708392) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- On connected 3-\(\gamma_L\)-dot-critical graphs (Q2151487) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- Locating-total domination in grid graphs (Q2305616) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- Optimal locating-total dominating sets in strips of height 3 (Q2516671) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The geodetic domination number of comb product graphs (Q4958003) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- Sharp bound on the truncated metric dimension of trees (Q6041544) (← links)
- \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)