Resolving sets for Johnson and Kneser graphs

A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard matrices, Steiner systems and toroidal grids.Comment: 23 pages, 2 figures, 1 tabl

Almost simple groups as flag-transitive automorphism groups of 2-designs with {\lambda} = 2

In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion, we present a classification of $2$-designs with $\lambda=2$ admitting flag-transitive and point-primitive automorphism groups of almost simple type, which states that such a $2$-design belongs to an infinite family of $2$-designs with parameter set $((3^n-1)/2,3,2)$ and $X=PSL_n(3)$ for some $n\geq 3$, or it is isomorphic to the $2$-design with parameter set $(6,3,2)$, $(7,4,2)$, $(10,4,2)$, $(10,4,2)$, $(11,5,2)$, $(28,7,2)$, $(28,3,2)$, $(36,6,2)$, $(126,6,2)$ or $(176,8,2)$