Maximal cliques in the graph of $5$-ary simplex codes of dimension two
Combinatorics
2024-02-09 v1
Abstract
We consider the induced subgraph of the corresponding Grassmann graph formed by -ary simplex codes of dimension , . This graph contains precisely two types of maximal cliques. If , then for any two maximal cliques of the same type there is a monomial linear automorphism transferring one of them to the other. Examples concerning the cases finish the note.
Cite
@article{arxiv.2402.05848,
title = {Maximal cliques in the graph of $5$-ary simplex codes of dimension two},
author = {Mariusz Kwiatkowski and Andrzej Matraś and Mark Pankov and Adam Tyc},
journal= {arXiv preprint arXiv:2402.05848},
year = {2024}
}