Pages that link to "Item:Q2344817"
From MaRDI portal
The following pages link to Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817):
Displayed 11 items.
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Irregular independence and irregular domination (Q2026322) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)