Pages that link to "Item:Q888612"

The following pages link to Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612):

Displaying 9 items.

• On the metric dimension of imprimitive distance-regular graphs (Q505687) (← 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)
• Metric dimension of dual polar graphs (Q2699116) (← links)
• Identifying codes for generalized quadrangles (Q6121096) (← links)