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 characterizes the class of connected symmetric graphs of valency 2pp a prime, whose autom...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Sherpa Romeo green journal. Open accessWe characterise connected cubic graphs admitting a vertex-tra...
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...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
AbstractThis paper investigates the automorphism group of a connected and undirected G-symmetric gra...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractWe use topological techniques to verify the existence of non-trivial semi-regular automorphi...
AbstractA regular edge- but not vertex-transitive graph is said to be semisymmetric. The study of se...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
AbstractA nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of ...
This paper characterizes the class of connected symmetric graphs of valency 2pp a prime, whose autom...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Sherpa Romeo green journal. Open accessWe characterise connected cubic graphs admitting a vertex-tra...
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...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
AbstractThis paper investigates the automorphism group of a connected and undirected G-symmetric gra...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractWe use topological techniques to verify the existence of non-trivial semi-regular automorphi...
AbstractA regular edge- but not vertex-transitive graph is said to be semisymmetric. The study of se...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
AbstractA nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of ...
This paper characterizes the class of connected symmetric graphs of valency 2pp a prime, whose autom...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
Sherpa Romeo green journal. Open accessWe characterise connected cubic graphs admitting a vertex-tra...