AbstractIn this paper, all pairwise non-isomorphic p-elementary abelian covering projections admitting a lift of an arc-transitive subgroup of the full automorphism group of the Pappus graph F18, the unique connected cubic symmetric graph of order 18, are constructed. The number of such covering projections is equal to 5, 19, 9, 11 and 5 if p=2, p=3, p≡7(mod12), p≡1(mod12) and p≡5(mod6), respectively. As results, three infinite families of cubic s-regular graphs for s=1, 2 and 3 are constructed, and a classification of the cubic s-regular graphs of order 18p for each s≥1 and each prime p is given. From the classification of cubic s-regular graphs of order 18p we have the following: (1) apart from the two 5-regular graphs F90 and F234B and t...
AbstractA general method for finding elementary abelian regular covering projections of finite conne...
AbstractFor a given finite connected graph Γ, a group H of automorphisms of Γ and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractIn this paper, all pairwise non-isomorphic p-elementary abelian covering projections admitti...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this paper, b...
AbstractIn this paper, we construct the pairwise non-congruent elementary abelian covers of the octa...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA regular cover X˜ of a connected graph X is called elementary abelian or cyclic if its grou...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of s-arcs. An infin...
AbstractAll pairwise non-isomorphic connected arc-transitive p-elementary abelian covers of the comp...
AbstractFor a given finite connected graph Γ, a group H of automorphisms of Γ and a finite group A, ...
AbstractA general method for finding elementary abelian regular covering projections of finite conne...
AbstractFor a given finite connected graph Γ, a group H of automorphisms of Γ and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractIn this paper, all pairwise non-isomorphic p-elementary abelian covering projections admitti...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this paper, b...
AbstractIn this paper, we construct the pairwise non-congruent elementary abelian covers of the octa...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractA regular cover X˜ of a connected graph X is called elementary abelian or cyclic if its grou...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of s-arcs. An infin...
AbstractAll pairwise non-isomorphic connected arc-transitive p-elementary abelian covers of the comp...
AbstractFor a given finite connected graph Γ, a group H of automorphisms of Γ and a finite group A, ...
AbstractA general method for finding elementary abelian regular covering projections of finite conne...
AbstractFor a given finite connected graph Γ, a group H of automorphisms of Γ and a finite group A, ...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...