AbstractMany famous graphs are edge-primitive, for example, the Heawood graph, the Tutte–Coxeter graph and the Higman–Sims graph. In this paper we systematically analyse edge-primitive and edge-quasiprimitive graphs via the O'Nan–Scott Theorem to determine the possible edge and vertex actions of such graphs. Many interesting examples are given and we also determine all G-edge-primitive graphs for G an almost simple group with socle PSL(2,q)
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte–Coxeter graph and t...
AbstractLet Γ be a graph and let G be a subgroup of automorphisms of Γ. Then G is said to be locally...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
AbstractLet Γ be a simple graph and let G be a group of automorphisms of Γ. The graph is (G, 2)-arc ...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractLet Γ be a graph and let G be a subgroup of automorphisms of Γ. Then G is said to be locally...
Open access, licensed under Creative CommonsIn this paper, we examine the structure of vertex- and e...
Let Gamma be a graph and let G be a subgroup of automorphisms of Gamma. Then G is said to be locally...
Let Gamma be a graph and let G be a subgroup of automorphisms of Gamma. Then G is said to be locally...
AbstractA graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitiv...
A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism bet...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
Many famous graphs are edge-primitive, for example, the Heawood graph, the Tutte–Coxeter graph and t...
AbstractLet Γ be a graph and let G be a subgroup of automorphisms of Γ. Then G is said to be locally...
AbstractA finite graph is said to be locally-quasiprimitive relative to a subgroup G of automorphism...
AbstractLet Γ be a simple graph and let G be a group of automorphisms of Γ. The graph is (G, 2)-arc ...
AbstractA permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are...
AbstractLet Γ be a graph and let G be a subgroup of automorphisms of Γ. Then G is said to be locally...
Open access, licensed under Creative CommonsIn this paper, we examine the structure of vertex- and e...
Let Gamma be a graph and let G be a subgroup of automorphisms of Gamma. Then G is said to be locally...
Let Gamma be a graph and let G be a subgroup of automorphisms of Gamma. Then G is said to be locally...
AbstractA graph is called edge- (vertex-) primitive if the group of automorphisms acts as a primitiv...
A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism bet...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...
A graph G is called quasirandom if it possesses typical properties of the corresponding random graph...