Neighbour-transitive codes in Kneser graphs
DOI10.1016/J.JCTA.2023.105850arXiv2307.09752OpenAlexW4389766076MaRDI QIDQ6201495FDOQ6201495
Authors: Dean Crnković, Daniel R. Hawtin, Nina Mostarac, Andrea Švob 
Publication date: 21 February 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.09752
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect codes in graphs
- Title not available (Why is that?)
- Completely transitive codes in Hamming graphs
- Minimal binary 2-neighbour-transitive codes
- Neighbour-transitive codes in Johnson graphs
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- Nonexistence of completely transitive codes with error-correcting capability e<3
- Perfect codes in Doob graphs
- Perfect Codes in Cayley Graphs
- On sets with few intersection numbers in finite projective and affine spaces
- Title not available (Why is that?)
- On completely regular codes
- On the classification of binary completely transitive codes with almost-simple top-group
- Sporadic neighbour-transitive codes in Johnson graphs
- Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$
This page was built for publication: Neighbour-transitive codes in Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201495)
