Add to ORKGA bipartite regular graph is called semisymmetric if its automorphism group has a single orbit on edges but two orbits on vertices (the two parts of the bipartition)
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
AbstractA graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-r...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
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...
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...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
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...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
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 simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
AbstractA graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-r...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set ...
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...
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...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
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...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
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 simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
AbstractA graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-r...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...