The endomorphism of Grassmann graphs

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 $J_q(n,m)$ is a pseudo-core. Moreover, the Grassmann graph $J_q(n,m)$ is a core whenever $m$ and $n-m+1$ are not relatively prime, and $J_q(2pk-2, pk-1)$ is a core whenever $p,k\geq 2$.Comment: 8 page