Cubic s-arc-transitive bi-Cayley graphs

Ran Ju, Jing Jian Li and Yang Gao

Applied Mathematics and Computation, 2025, vol. 498, issue C

Abstract: A bipartite graph Γ is a bi-Cayley graph over a group H if H⩽AutΓ acts regularly on each part of Γ. A bi-Cayley graph Γ over a group H is said to be core-free if H is core-free in the bipartition-preserving subgroup of X for X⩽AutΓ. In this paper, a classification is given for cubic core-free s-arc-transitive bi-Cayley graphs.

Keywords: Bi-Cayley graph; Symmetric graph; Core-free (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325001274
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:498:y:2025:i:c:s0096300325001274

DOI: 10.1016/j.amc.2025.129400

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().