Pages that link to "Item:Q1926037"
From MaRDI portal
The following pages link to Optimal identifying codes in cycles and paths (Q1926037):
Displaying 13 items.
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)