Neighbour-transitive codes in Kneser graphs

DOI10.1016/J.JCTA.2023.105850MaRDI QIDQ6201495OpenAlexFDO

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

zbMATH Keywords

Kneser graphcompletely transitive codeneighbour-transitive code

Mathematics Subject Classification ID

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)

Recommendations

• Neighbour-transitive codes in Johnson graphs
• Neighbour transitivity on codes in Hamming graphs
• Sporadic neighbour-transitive codes in Johnson graphs
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Entry-faithful 2-neighbour transitive codes

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Block designs and strongly regular graphs admitting a transitive action of the Mathieu group \(M_{11}\)
• Completely transitive codes in Hamming graphs
• Minimal binary 2-neighbour-transitive codes
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• Neighbour-transitive codes in Johnson graphs
• Nonexistence of completely transitive codes with error-correcting capability e<3
• On completely regular codes
• On sets with few intersection numbers in finite projective and affine spaces
• On the classification of binary completely transitive codes with almost-simple top-group
• Perfect codes in Cayley graphs
• Perfect codes in Doob graphs
• Perfect codes in graphs
• 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)