EUVIMEDEUVIMED entdecken
Crossref

On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs

Hao Nan Chen, Jing Jian Li, Ji Cheng Ma, Hao Yu

The Electronic Journal of Combinatorics · 06.11.2026 · 33 (4)

DOI: 10.37236/15130 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 06.11.2026. Verfasst von Hao Nan Chen und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph is called edge-primitive if its full automorphism group acts primitively on its edge set. In this paper, we give a complete classification of all types of finite edge-primitive $2$-arc-transitive Cayley graphs and bi-Cayley graphs.

Zitieren

APA

Chen, H. N., Li, J. J., Ma, J. C., & Yu, H. (2026). On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/15130

Vancouver

Chen HN, Li JJ, Ma JC, Yu H. On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/15130

BibTeX
@article{Chen2026,
  author = {Chen, Hao Nan and Li, Jing Jian and Ma, Ji Cheng and Yu, Hao},
  title = {On Edge-Primitive $2$-Arc-Transitive (Bi-)Cayley Graphs},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {4},
  doi = {10.37236/15130}
}
Kostenlos starten →