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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
