A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Malnic et al. (Discrete Math 274 (2004), 187-198) classified the connected cubic edge-transitive, but not vertex-transitive graphs of order 2p(3) for each prime p. In this article, we determine the s-regularity of all connected cubic symmetric graphs of order 2p(3) for each prime p and each s. (C) 2006 Wiley Periodicals, Inc.MathematicsSCI(E)EI15ARTICLE4341-3525
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
AbstractA graph G is locally s-regular if for any two s-arcs of G having the same head there exists ...
A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this paper, b...
Abstract. An automorphism group of a graph is said to be s-regular if it acts regularly on the set o...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
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...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
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 s-regular if its automorphism group acts regularly on the set of its s-arcs. In this pape...
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...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
AbstractA graph G is locally s-regular if for any two s-arcs of G having the same head there exists ...
A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this paper, b...
Abstract. An automorphism group of a graph is said to be s-regular if it acts regularly on the set o...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
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...
AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In t...
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 s-regular if its automorphism group acts regularly on the set of its s-arcs. In this pape...
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...
Abstract. A regular graph Γ is said to be semisymmetric if its full automorphism group acts transiti...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
AbstractA graph G is locally s-regular if for any two s-arcs of G having the same head there exists ...
A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this paper, b...
DOI
Add to ORKG