AbstractConnected cubic graphs Γ of twice odd order which admit an automorphism group acting semisymmetrically are investigated. The structure of the automorphism group of Γ modulo a subgroup which acts semiregularly on Γ is determined. This identification is achieved by using the fundamental theorem of Goldschmidt [D.M. Goldschmidt, Automorphisms of trivalent graphs, Ann. of Math. (2) 111 (2) (1980) 377–406] and some small parts of the proof of the classification of the finite simple groups
This paper discusses the automorphism group of a class of weakly semiregular bipartite graphs and ...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractConnected cubic graphs Γ of twice odd order which admit an automorphism group acting semisym...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
A graph Gamma is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := A...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
Abstract. An automorphism group of a graph is said to be s-regular if it acts regularly on the set o...
A bipartite regular graph is called semisymmetric if its automorphism group has a single orbit on ed...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
AbstractThis paper investigates the automorphism group of a connected and undirected G-symmetric gra...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
This paper discusses the automorphism group of a class of weakly semiregular bipartite graphs and ...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractConnected cubic graphs Γ of twice odd order which admit an automorphism group acting semisym...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
A graph Gamma is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := A...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
Abstract. An automorphism group of a graph is said to be s-regular if it acts regularly on the set o...
A bipartite regular graph is called semisymmetric if its automorphism group has a single orbit on ed...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
AbstractThis paper investigates the automorphism group of a connected and undirected G-symmetric gra...
AbstractIt is shown that a vertex-transitive graph of valency p+1, p a prime, admitting a transitive...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
This paper discusses the automorphism group of a class of weakly semiregular bipartite graphs and ...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...