AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular edge-transitive graph of order 2p or 2p2 is necessarily vertex-transitive. In this paper an extension of his result in the case of cubic graphs is given. It is proved that, with the exception of the Gray graph on 54 vertices, every cubic edge-transitive graph of order 2p3 is vertex-transitive
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular ed...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
AbstractAn infinite family of cubic edge- but not vertex-transitive graphs is constructed. The graph...
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respe...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
A graph X is called vertex-transitive, edge-transitive, or arc-transitive, if the automorphism group...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
AbstractLet p be a prime. It was shown by Folkman (J. Combin. Theory 3 (1967) 215) that a regular ed...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
AbstractA regular edge-transitive graph is said to be semisymmetric if it is not vertex-transitive. ...
A graph is called edge-transitive, if its full automorphismgroup acts transitively on its edge set. ...
AbstractAn infinite family of cubic edge- but not vertex-transitive graphs is constructed. The graph...
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respe...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
AbstractIt is proved that every connected cubic simple graph admitting a vertex-transitive action of...
A graph X is called vertex-transitive, edge-transitive, or arc-transitive, if the automorphism group...
AbstractIn this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitiv...
A simple undirected graph is called semisymmetric if it is regular and edge transitive but not verte...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
DOI
Add to ORKG