1/2-Transitive Graphs of Order 3p

Authors:
Brian Alspach;Ming-Yao Xu
Affiliations:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, B.C. V5A 1S6, Canada;Institute of Mathematics, Peking University, Beijing 100871, People's Republic of China
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
1994

Citing 0
Cited 12

Constructing ½-arc-transitive graphs of valency 4 and vertex stabilizer Z2× Z2

Discrete Mathematics
Constructing graphs with several pseudosimilar vertices or edges

Discrete Mathematics - Special issue: Combinatorics 2000
On edge-transitive Cayley graphs of valency four

European Journal of Combinatorics
Automorphism Groups of Metacirculant Graphs of Order a Product of Two Distinct Primes

Combinatorics, Probability and Computing
Tetravalent half-transitive graphs of order 4p

European Journal of Combinatorics
Tetravalent half-arc-transitive graphs of order p4

European Journal of Combinatorics
A classification of tightly attached half-arc-transitive graphs of valency 4

Journal of Combinatorial Theory Series B
On quartic half-arc-transitive metacirculants

Journal of Algebraic Combinatorics: An International Journal
Hexavalent half-arc-transitive graphs of order 4p

European Journal of Combinatorics
An infinite family of half-arc-transitive graphs with universal reachability relation

European Journal of Combinatorics
Half-Edge-Transitive Graphs and Non-Normal Cayley Graphs

Journal of Graph Theory
A family of edge-transitive Frobenius metacirculants of small valency

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph X is called vertex-transitive, edge-transitive, or arc-transitive, if the automorphism group of X acts transitively on the set of vertices, edges, or arcs of X, respectively. X is said to be 1/2-transitive, if it is vertex-transitive, edge-transitive, but not arc-transitive.In this paper we determine all 1/2-transitive graphs with 3p vertices, where p is an odd prime. (See Theorem 3.4.)