Projects 11371072, 11301270, 11271047, 11371204, 11501036 supported by NSFC. Supported by the Fundamental Research Funds for the Central University of China, Youth Scholar Program of Beijing Normal University (2014NT31) and China Postdoctoral Science Foundation (2015M570958).
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学院
摘要:
A graph G is a core if every endomorphism of G is an automorphism. A graph is called a pseudo-core if every its endomorphism is either an automorphism or a colouring. Suppose that J(q) (n, m) is a Grassmann graph over a finite field with q elements. We show that every Grassmann graph is a pseudo-core. Moreover, J(2) (4, 2) is not a core ...