301 KB25 KB200820252016Huang, Li-PingLv, BenjianWang, Kaishunletnik:10številka:2str. 383-392COBISSID:17835353ISSN:1855-3966URN:URN:NBN:SI:doc-460LXXA1enUniverza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologijeArs mathematica contemporaneacoreendomorfizemendomorphismGrassmann graphGrassmannov grafjedromaksimalna klikamaximal cliquepseudo-corepsevdo-jedroThe endomorphisms of Grassmann graphs|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 and ?$J_{q}(2k + 1,2)(k \ge 2)$? is a coreGraf ?$G$? je jedro, če je vsak endomorfizem grafa ?$G$? avtomorfizem. Graf se imenuje psevdo-jedro, če je vsak endomorfizem bodisi avtomorfizem bodisi barvanje. Denimo, da je ?$J_{q}(n,m)$? Grassmannov graf nad končnim obsegom s ?$q$? elementi. Pokažemo, da je vsak Grassmannov graf psevdo-jedro. Še več, ?$J_{2}(4,2)$? ni jedro in ?$J_{q}(2k + 1,2)(k \ge 2)$? je jedroTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije