The endomorphisms of Grassmann graphs

From MaRDI portal



Abstract: A graph is called a pseudo-core if every endomorphism is either an automorphism or a colouring. In this paper, we show that every Grassmann graph Jq(n,m) is a pseudo-core. Moreover, the Grassmann graph Jq(n,m) is a core whenever m and n−m+1 are not relatively prime, and Jq(2pk−2,pk−1) is a core whenever p,kgeq2.











This page was built for publication: The endomorphisms of Grassmann graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827789)