2002
DOI: 10.1006/eujc.2002.0579
|View full text |Cite
|
Sign up to set email alerts
|

On 1-Arc-regular Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 17 publications
0
15
0
Order By: Relevance
“…Problem A was partially considered in [5] for a connected cubic G-basic graph Γ , and in this paper we completely solve it (Theorem 1.1) for solvable groups, but it is still elusive when G is nonsolvable.…”
Section: Problem B Which Cubic Symmetric Graphs Are Cayley?mentioning
confidence: 99%
“…Problem A was partially considered in [5] for a connected cubic G-basic graph Γ , and in this paper we completely solve it (Theorem 1.1) for solvable groups, but it is still elusive when G is nonsolvable.…”
Section: Problem B Which Cubic Symmetric Graphs Are Cayley?mentioning
confidence: 99%
“…Take a Sylow 5-subgroup, say P , of G, and set H = N G (P ). From Atlas [7, pp.4] it is easily known that H ∼ = D 10 . Note that all involutions in G are conjugate each other.…”
Section: Constructions Of Pentavalent Symmetric Graphsmentioning
confidence: 99%
“…Recently, Li [22] classified vertex-primitive and vertex-biprimitive s-transitive graphs for s ≥ 4, and Fang et al [8] classified vertex-primitive 2-regular graphs. For more results on symmetric graphs with general valencies, see, for example, [10,20,21,22]. Despite all of these efforts, however, further classifications of symmetric graphs with general valencies seem to be very difficult.…”
Section: Introductionmentioning
confidence: 99%
“…Denote by E = {B o , B\, ... , 6/_i) the set of orbits of N on V(X). Since N <l G, E is a complete block system of G. Consider the quotient graph X of X defined by V(X) = E and (B n fi 7 ) e E(X) if and only if there exist u, e B, and Vj e Bj such that (u,, Vj) e E(X). If N has more than two orbits, Lorimer [14,Theorem 9] showed that X is a cubic graph and G/N is a solvable one-regular subgroup of Aut(X) (also see [21]).…”
Section: Preliminariesmentioning
confidence: 99%