The following pages link to Robert F. Bailey (Q306347):
Displaying 24 items.
- On generalized Howell designs with block size three (Q306349) (← links)
- Generalized packing designs (Q385379) (← links)
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher (Q783063) (← links)
- Uncoverings-by-bases for base-transitive permutation groups. (Q851785) (← links)
- Error-correcting codes from permutation groups (Q1043942) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- Resolving sets for Johnson and Kneser graphs (Q1940362) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- Decoding the Mathieu group \(M_{12}\) (Q2470821) (← links)
- Metric dimension of dual polar graphs (Q2699116) (← links)
- A note on packing spanning trees in graphs and bases in matroids (Q2876023) (← links)
- The metric dimension of small distance-regular and strongly regular graphs (Q2947380) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Uncoverings on graphs and network reliability (Q3101019) (← links)
- Base size, metric dimension and other invariants of groups and graphs (Q3169264) (← links)
- On the single-orbit conjecture for uncoverings-by-bases (Q3544298) (← links)
- On Orthogonal Matrices with Zero Diagonal (Q5230554) (← links)
- On the metric dimension of Grassmann graphs (Q5414561) (← links)
- Distance Enumerators for Permutation Groups (Q5426293) (← links)
- Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns (Q5499920) (← links)
- Block colourings of star systems (Q6041533) (← links)
