Add to ORKGA graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set but not on its vertex set. In this paper, we prove thatthere is only one semisymmetric cubic graph of order 28p<sub>2</sub>, where p is a prime. DOI : http://dx.doi.org/10.22342/jims.16.2.38.139-14
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this pape...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
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...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
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. ...
AbstractConnected cubic graphs Γ of twice odd order which admit an automorphism group acting semisym...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
A bipartite regular graph is called semisymmetric if its automorphism group has a single orbit on ed...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this pape...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...
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...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
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. ...
AbstractConnected cubic graphs Γ of twice odd order which admit an automorphism group acting semisym...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
A bipartite regular graph is called semisymmetric if its automorphism group has a single orbit on ed...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
AbstractAn old conjecture of Marušič, Jordan and Klin asserts that any finite vertex-transitive grap...
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this pape...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
AbstractLet ℘N:X˜→X be a regular covering projection of connected graphs with the group of covering ...