Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Repository of the University of Ljubljana
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Advanced
New in RUL
About RUL
In numbers
Help
Sign in
Details
Edge-transitive cubic graphs: analysis, cataloguing and enumeration
ID
Conder, Marston D. E.
(
Author
),
ID
Potočnik, Primož
(
Author
)
PDF - Presentation file,
Download
(1,64 MB)
MD5: 7D7D425647CA15EB79DD83A24AC868C1
URL - Source URL, Visit
https://www.sciencedirect.com/science/article/pii/S002186932500448X
Image galllery
Abstract
This paper deals with finite cubic (3-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these divide respectively into 7 types (according to a classification by Djoković and Miller (1980) [17]) and 15 types (according to a classification by Goldschmidt (1980) [23]), in terms of certain group amalgams. Such graphs of small order were previously known up to orders 2048 and 768, respectively, and we have extended each of the two lists of all such graphs up to order 10000. Before describing how we did that, we carry out an analysis of the 22 amalgams, to show which of the finitely-presented groups associated with the 15 Goldschmidt amalgams can be faithfully embedded in one or more of the other 21 (as subgroups of finite index), complementing what is already known about such embeddings of the 7 Djoković-Miller groups in each other. We also give an example of a graph of each of the 22 types, and in most cases, describe the smallest such graph, and we then use regular coverings to prove that there are infinitely many examples of each type. Finally, we discuss the asymptotic enumeration of the graph orders, proving that if $f_{\mathcal C}(n)$ is the number of cubic edge-transitive graphs of type ${\mathcal C}$ on at most $n$ vertices, then there exist positive real constants $a$ and $b$ and a positive integer $n_0$ such that $n^{a \log(n)} \le f_{\mathcal C}(n) \le n^{b \log(n)}$ for all $n\ge 0$.
Language:
English
Keywords:
groups
,
graphs
,
symmetry
,
amalgams
,
cover
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FMF - Faculty of Mathematics and Physics
Publication status:
Published
Publication version:
Version of Record
Publication date:
01.01.2026
Year:
2026
Number of pages:
Str. 703-737
Numbering:
Vol. 685
PID:
20.500.12556/RUL-171239
UDC:
519.17
ISSN on article:
0021-8693
DOI:
10.1016/j.jalgebra.2025.07.035
COBISS.SI-ID:
246127363
Publication date in RUL:
21.08.2025
Views:
144
Downloads:
79
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Record is a part of a journal
Title:
Journal of algebra
Shortened title:
J. algebra
Publisher:
Elsevier
ISSN:
0021-8693
COBISS.SI-ID:
1310986
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Projects
Funder:
New Zealand’s Marsden Fund
Project number:
UOA2320
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0294
Name:
Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
J1-4351
Name:
Generiranje, analiza in katalogizacija simetričnih grafov
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back