Pages that link to "Item:Q1753015"
From MaRDI portal
The following pages link to On the minimum size of an identifying code over all orientations of a graph (Q1753015):
Displaying 9 items.
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On finding the best and worst orientations for the metric dimension (Q6093374) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)