{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T08:42:54Z","timestamp":1758357774269,"version":"3.44.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A graph $\\Gamma$ is edge-transitive\u00a0($s$-arc-transitive, respectively) if its full automorphism group $\\rm Aut\\,(\\Gamma)$ acts transitively on the set of edges (the set of $s$-arcs in $\\Gamma$ for an integer $s\\geq 0$, respectively). A $1$-arc-transitive graph is called an arc-transitive graph or a symmetric graph. In this paper, we construct cubic symmetric bi-Cayley graphs over some groups of order $p^4$, where $p\\geq 7$ is a prime. Using these constructions, we classify the connected cubic edge-transitive graphs of order $2p^4$ for each prime $p$ and we also show that all these graphs are symmetric.<\/jats:p>","DOI":"10.37236\/13675","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T14:17:42Z","timestamp":1758291462000},"source":"Crossref","is-referenced-by-count":0,"title":["Cubic Edge-Transitive Graphs of Order $2p^4$"],"prefix":"10.37236","volume":"32","author":[{"given":"Xue","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sejeong","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Xin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2025,9,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p51\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p51\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T14:17:43Z","timestamp":1758291463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i3p51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/13675","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"article-number":"P3.51"}}