2014
DOI: 10.2298/fil1402285f
|View full text |Cite
|
Sign up to set email alerts
|

Tetravalent one-regular graphs of order 4p2

Abstract: Abstract.A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper tetravalent one-regular graphs of order 4p 2 , where p is a prime, are classified.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
5
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…Also, by [6,35,36,44,50, 51] every tetravalent one-regular graph of order pq or p 2 is a circulant graph. Furthermore, the classification of tetravalent one-regular graphs of order 3p 2 , 4p 2 , 5p 2 , 6p 2 and 2pq are given in [8,18,19,20,54]. Along this line we obtain Theorem 3.1, which is the main result of the paper.…”
mentioning
confidence: 69%
“…Also, by [6,35,36,44,50, 51] every tetravalent one-regular graph of order pq or p 2 is a circulant graph. Furthermore, the classification of tetravalent one-regular graphs of order 3p 2 , 4p 2 , 5p 2 , 6p 2 and 2pq are given in [8,18,19,20,54]. Along this line we obtain Theorem 3.1, which is the main result of the paper.…”
mentioning
confidence: 69%
“…It is known that there are precisely eight non-abelian simple groups whose orders are divisible by at most three distinct primes (see, for example, [12]); these are Alt(5), PSL(2, 7), Alt(6), PSL (2,8), PSL (2,17), PSL (3,3), PSU (3,3), and PSU (4,2). Out of these, only the first five are such that the odd primes appear with multiplicity at most 2; these five groups, together with their orders and the orders of their automorphism groups are listed in Table 2.…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
“…If p = 7, then the order 2 a 3 b 7 c of Γ is larger than 1000 only when a = 3, b = 1 and c = 2. Since 9 divides the order of PSL (2,8), this implies that T ∼ = PSL (2,8), and therefore T ∼ = PSL(2, 7) and |V (Γ)| = 8 • 3 • 7 2 = 1176.…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
See 1 more Smart Citation
“…Also, by [5,27,28,30,34,35] every 4-valent one-regular graph of order pq or p 2 is a circulant graph. Furthermore, the classification of 4-valent oneregular graphs of order 3p 2 , 4p 2 , 6p 2 and 2pq are given in [8,15,17,37]. Along this line the aim of this paper is to classify 4-valent one-regular graphs of order 5p 2 , see Theorem 3.3.…”
Section: Introductionmentioning
confidence: 99%