Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks

Abstract: A graph

G a m m a

is called

G

-symmetric if it admits

G

as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of

G

-symmetric graphs

G a m m a

with

V (G a m m a)

admitting a nontrivial

G

-invariant partition

m a t h c a l B

such that there is exactly one edge of

G a m m a

between any two distinct blocks of

m a t h c a l B

. This is achieved by giving a classification of

(G, 2)

-point-transitive and

G

-block-transitive designs

m a t h c a l D

together with

G

-orbits

O m e g a

on the flag set of

m a t h c a l D

such that

G_{s i g m a, L}

is transitive on

L s e t m i n u s s i g m a

and

L c a p N = s i g m a

for distinct

(s i g m a, L), (s i g m a, N) i n O m e g a

, where

G_{s i g m a, L}

is the setwise stabilizer of

L

in the stabilizer

G_{s i g m a}

of

s i g m a

in

G

. Along the way we determine all imprimitive blocks of

G_{s i g m a}

on

V s e t m i n u s s i g m a

for every

2

-transitive group

G

on a set

V

, where

s i g m a i n V

.

Recommendations

Cites Work

Cited In (8)

Uses Software

This page was built for publication: Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks