Pages that link to "Item:Q888612"
From MaRDI portal
The following pages link to Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612):
Displaying 16 items.
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- Partition dimension of projective planes (Q2400970) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Metric dimension of dual polar graphs (Q2699116) (← links)
- On the metric dimension of affine planes, biaffine planes and generalized quadrangles (Q4622616) (← links)
- On the metric dimension of incidence graph of M\"obius planes (Q5080905) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- Identifying codes with small radius in some infinite regular graphs (Q5960786) (← links)
- Identifying codes for generalized quadrangles (Q6121096) (← links)
