Abstract
Let Γk(V) be the Grassmann graph formed by k-dimensional subspaces of an n-dimensional vector space over the finite field Fq consisting of q elements and 1<k<n−1. Denote by Γ(n,k)q the restriction of the Grassmann graph to the set of all non-degenerate linear [n,k]q codes. We describe maximal cliques of the graph Γ(n,k)q and show that every automorphism of this graph is induced by a monomial semilinear automorphism of V.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
