A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs. (C) 2002 Published by Elsevier Science Ltd.MathematicsSCI(E)7ARTICLE6707-7112
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
A detailed description is given of a recently-discovered edge- but not vertex-transitive trivalent ...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
For a group T and a subset S of T, the bi-Cayley graph BCay(T, S) of T with respect to S is the bipa...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
AbstractIn this paper, we construct semisymmetric graphs in which no two vertices have exactly the s...
AbstractEvery finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-tr...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
Given an infinite family of finite primitive groups, conditions are found which ensure that almost a...
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transiti...
A graph Gamma is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := A...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
A detailed description is given of a recently-discovered edge- but not vertex-transitive trivalent ...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
For a group T and a subset S of T, the bi-Cayley graph BCay(T, S) of T with respect to S is the bipa...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
AbstractIn this paper, we construct semisymmetric graphs in which no two vertices have exactly the s...
AbstractEvery finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-tr...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
Given an infinite family of finite primitive groups, conditions are found which ensure that almost a...
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transiti...
A graph Gamma is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := A...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
A detailed description is given of a recently-discovered edge- but not vertex-transitive trivalent ...
The Gray graph is the smallest trivalent semisymmetric graph; it has 54 vertices. We present three d...
DOI
Add to ORKG