On 2-distance-transitive circulants
From MaRDI portal
Publication:2423371
DOI10.1007/s10801-018-0825-3zbMath1414.05099OpenAlexW2804842195WikidataQ129764034 ScholiaQ129764034MaRDI QIDQ2423371
Wei Jin, Cai Heng Li, Jiyong Chen
Publication date: 21 June 2019
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-018-0825-3
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Related Items (4)
FINITE TWO-DISTANCE-TRANSITIVE DIHEDRANTS ⋮ Two-distance transitive normal Cayley graphs ⋮ Two-geodesic transitive graphs of order \(p^n\) with \(n \leq 3\) ⋮ An explicit characterization of arc-transitive circulants
Cites Work
- Unnamed Item
- On generalised Paley graphs and their automorphism groups
- On the full automorphism group of a graph
- Automorphism groups and isomorphisms of Cayley digraphs
- Distance-regular circulants
- Classifying arc-transitive circulants
- Permutation groups with a cyclic regular subgroup and arc transitive circulants.
- A classification of 2-arc-transitive circulants
- On normal 2-geodesic transitive Cayley graphs
- Locally \(s\)-distance transitive graphs and pairwise transitive designs
- Vertex-transitive graphs
- Finite 2-Geodesic Transitive Graphs of Prime Valency
- Locally s-distance transitive graphs
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Algebraic Graph Theory
- Finite normal edge-transitive Cayley graphs
- On Orthogonal Matrices
- Finite 2‐Distance Transitive Graphs
This page was built for publication: On 2-distance-transitive circulants