AbstractA configuration is weakly flag-transitive if its group of automorphisms acts intransitively on flags but the group of all automorphisms and anti-automorphisms acts transitively on flags. It is shown that weakly flag-transitive configurations are in one-to-one correspondence with bipartite12-arc-transitive graphs of girth not less than 6. Several infinite families of weakly flag-transitive configurations are given via their Levi graphs. Among others an infinite family of non-self-polar weakly flag-transitive configurations is constructed. The smallest known weakly flag-transitive configuration has 27 points and the smallest known non-self-polar weakly flag-transitive configuration has 34 points
AbstractWe show that for fixed λ, there exist only finitely many 2-(ν, k, λ) designs admitting a fla...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
AbstractWe present a new family of locally 5-arc transitive graphs. The graphs constructed are bipar...
AbstractA configuration is weakly flag-transitive if its group of automorphisms acts intransitively ...
AbstractWeakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on vertices and e...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractA subgroupG of automorphisms of a graphX is said to be 12- transitive if it is vertex- and e...
AbstractA graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-tra...
AbstractA graph is said to be 12-transitive if its automorphism group acts transitively on vertices ...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on its vertex set...
AbstractFor each primep≡ 1 or −1(mod24), we construct a (PSL(2,p), 2)-arc transitive graph Γ of vale...
A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive....
AbstractThe action of a subgroupGof automorphisms of a graphXis said to be 12-transitiveif it is ver...
AbstractWe show that for fixed λ, there exist only finitely many 2-(ν, k, λ) designs admitting a fla...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
AbstractWe present a new family of locally 5-arc transitive graphs. The graphs constructed are bipar...
AbstractA configuration is weakly flag-transitive if its group of automorphisms acts intransitively ...
AbstractWeakly s-arc transitive graphs are introduced and determined. A graph is said to be weakly s...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on vertices and e...
AbstractThe action of a subgroup G of automorphisms of a graph X is said to be half-arc-transitive i...
A vertex-transitive graph X is said to be half-arc-transitive if its automorphism group acts transit...
AbstractA subgroupG of automorphisms of a graphX is said to be 12- transitive if it is vertex- and e...
AbstractA graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-tra...
AbstractA graph is said to be 12-transitive if its automorphism group acts transitively on vertices ...
AbstractA graph is half-arc-transitive if its automorphism group acts transitively on its vertex set...
AbstractFor each primep≡ 1 or −1(mod24), we construct a (PSL(2,p), 2)-arc transitive graph Γ of vale...
A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive....
AbstractThe action of a subgroupGof automorphisms of a graphXis said to be 12-transitiveif it is ver...
AbstractWe show that for fixed λ, there exist only finitely many 2-(ν, k, λ) designs admitting a fla...
AbstractA graph is said to be half-arc-transitive if its automorphism group acts transitively on the...
AbstractWe present a new family of locally 5-arc transitive graphs. The graphs constructed are bipar...