The following pages link to (Q3992965):
Displaying 50 items.
- A bound on the Laplacian spread which is tight for strongly regular graphs (Q252596) (← links)
- The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\) (Q252843) (← links)
- An Erdős-Ko-Rado theorem for finite classical polar spaces (Q256539) (← links)
- Completely regular clique graphs. II (Q256544) (← links)
- On the distance between linear codes (Q268498) (← links)
- Adjacency preservers on invertible Hermitian matrices. I. (Q269533) (← links)
- Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
- Biregular graphs with three eigenvalues (Q281935) (← links)
- A problem of Shapozenko on Johnson graphs (Q283683) (← links)
- A new near octagon and the Suzuki tower (Q286124) (← links)
- Polynomial properties on large symmetric association schemes (Q295296) (← links)
- Asymptotic Delsarte cliques in distance-regular graphs (Q295820) (← links)
- Notes on simplicial rook graphs (Q295823) (← links)
- Three-valued Gauss periods, circulant weighing matrices and association schemes (Q295828) (← links)
- Recent progress on weight distributions of cyclic codes over finite fields (Q307903) (← links)
- Dimensional dual hyperovals in classical polar spaces (Q310252) (← links)
- On the number of matroids (Q313452) (← links)
- A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces (Q326333) (← links)
- Regular partitions of half-spin geometries (Q331166) (← links)
- Strongly uniform extensions of dual 2-designs (Q338014) (← links)
- On antipodal distance-regular graphs with \(\mu=1\) (Q352218) (← links)
- Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\) (Q352231) (← links)
- On the connectedness of the complement of a ball in distance-regular graphs (Q356734) (← links)
- The independence number for polarity graphs of even order planes (Q356737) (← links)
- Metric dimension of some distance-regular graphs (Q358647) (← links)
- Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets (Q364715) (← links)
- Bipartite distance-transitive doubles with primitive halved of diameter two (Q367038) (← links)
- Character tables of association schemes based on attenuated spaces (Q368455) (← links)
- On automorphisms of a distance-regular graph with intersection array \(\{51, 48, 8; 1, 4, 36\}\) (Q378192) (← links)
- Permanent versus determinant over a finite field (Q378689) (← links)
- On graphs whose local subgraphs are strongly regular with parameters \((115, 18, 1, 3)\) (Q382200) (← links)
- On the existence of tight relative 2-designs on binary Hamming association schemes (Q383342) (← links)
- A characterization of the natural embedding of the split Cayley hexagon in \(\mathrm{PG}(6,q)\) by intersection numbers in finite projective spaces of arbitrary dimension (Q383346) (← links)
- Edge-distance-regular graphs are distance-regular (Q385034) (← links)
- Three-class association schemes from cyclotomy (Q388190) (← links)
- On some approaches to the spectral excess theorem for nonregular graphs (Q388198) (← links)
- A note on binary completely regular codes with large minimum distance (Q389210) (← links)
- Antipodal distance-transitive covers with primitive quotient of diameter two (Q389455) (← links)
- A new characterization of taut distance-regular graphs of odd diameter (Q393160) (← links)
- Linear codes on posets with extension property (Q393354) (← links)
- On distance-regular graphs in which neighborhoods of vertices are strongly regular (Q393853) (← links)
- On graphs whose local subgraphs are strongly regular with parameters \((162, 21, 0, 3)\) (Q393860) (← links)
- On almost distance-transitive graphs (Q393869) (← links)
- On a family of binary completely transitive codes with growing covering radius (Q394307) (← links)
- Pooling semilattices and non-adaptive pooling designs (Q394365) (← links)
- The spectral excess theorem for distance-biregular graphs. (Q396831) (← links)
- The Terwilliger algebra of the incidence graphs of Johnson geometry (Q396913) (← links)
- Bipartite distance-regular graphs: the \(Q\)-polynomial property and pseudo primitive idempotents (Q397139) (← links)
- Completely regular clique graphs (Q402941) (← links)
- Regular graphs with maximal energy per vertex (Q403366) (← links)
