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 is a pseudo-core. Moreover, the Grassmann graph is a core whenever and are not relatively prime, and is a core whenever .
Recommendations
Cited in
(16)- Some results on ends and automorphisms of graphs
- Homomorphisms and amalgamation
- Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
- Endomorphisms and cores of quadratic forms graphs in odd characteristic
- Cores and independence numbers of Grassmann graphs
- Endomorphisms of quadratic forms graph in characteristic two
- Global asymptotic stability for a nonlinear density-dependent mortality Nicholson's blowflies system involving multiple pairs of time-varying delays
- Asymptotically almost periodic dynamics on delayed Nicholson-type system involving patch structure
- Anti-periodicity on high-order inertial Hopfield neural networks involving mixed delays
- Convergence analysis on inertial proportional delayed neural networks
- Anti-periodic dynamics on high-order inertial Hopfield neural networks involving time-varying delays
- Automorphisms of Grassmann graphs over a residue class ring
- Endomorphisms of twisted Grassmann graphs
- On endomorphisms of alternating forms graph
- A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
- Endomorphism spectra of graphs
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)