2013
DOI: 10.1007/s11425-013-4708-8
|View full text |Cite
|
Sign up to set email alerts
|

Tetravalent edge-transitive graphs of order p 2 q

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
11
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 25 publications
0
11
0
Order By: Relevance
“…By [21], we have the following lemma regarding the tetravalent edge-transitive graph with odd but not a prime power order.…”
Section: Lemma 23 Let M Be a Soluble Maximal Subgroup Of Gl(2 P) Then M Is Isomorphic To One Of The Following Groupsmentioning
confidence: 99%
See 2 more Smart Citations
“…By [21], we have the following lemma regarding the tetravalent edge-transitive graph with odd but not a prime power order.…”
Section: Lemma 23 Let M Be a Soluble Maximal Subgroup Of Gl(2 P) Then M Is Isomorphic To One Of The Following Groupsmentioning
confidence: 99%
“…The tetravalent half-arc-transitive graphs of order p 3 , p 4 and 2pq are classified in [8], [9], [32], respectively. Recently, Pan et al in [21] classified tetravalent edge-transitive graphs of order p 2 q. Wang et al in [30] studied tetravalent half-arc-transitive graphs of order a product of three primes.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the literature, there are lots of works in classifying symmetric graphs of order kp n and small valency d, especially with n and k small and d = 3, 4, or 5; see [6,7,12,13,24,25,27] for example. In particular, cubic or pentavalent symmetric basic graphs of order 2p n for variable prime p and integer n were classified completely in [6,7], and tetravalent 2-arc-transitive basic graphs of order 2p n were classified in [27].…”
Section: Introductionmentioning
confidence: 99%
“…As applications of above works, symmetric graphs of order 2p 2 and valency 3, 4 or 5 were determined (for valency 5, one may also refer [24]). Cubic and tetravalent symmetric graphs of order kp n for some small integer k with k > 2 were also well studied (see [4,22,25]). This paper concerns pentavalent symmetric graphs of order kp n with k > 2, and the following theorem is the main result.…”
Section: Introductionmentioning
confidence: 99%