{"paper":{"title":"Semisymmetric graphs of order $2p^3$","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Li Wang, Shaofei Du","submitted_at":"2012-06-10T14:43:45Z","abstract_excerpt":"A simple undirected graph is said to be {\\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\\em J. Combin. Theory Ser. B} {\\bf 3}(1967), 215-232] that there exist no semisymmetric graphs of order $2p$ and $2p^2$, where $p$ is a prime. The classification of semisymmetric graphs of order $2pq$ was given in [{\\em Comm. in Algebra} {\\bf 28}(2000), 2685-2715], for any distinct primes $p$ and $q$. Our long term goal is to determine all the semisymmetric graphs of order $2p^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2033","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}