Photo from wikipedia
A graph G is called a pseudo-core if every endomorphism of G is either an automorphism or a colouring. An interesting problem in graph theory is to distinguish whether a… Click to show full abstract
A graph G is called a pseudo-core if every endomorphism of G is either an automorphism or a colouring. An interesting problem in graph theory is to distinguish whether a graph is a core. The twisted Grassmann graphs, constructed by van Dam and Koolen in (Invent Math 162:189–193, 2005), are the first known family of non-vertex-transitive distance-regular graphs with unbounded diameter. In this paper, we show that every twisted Grassmann graph is a pseudo-core.
Keywords:
graphs;
endomorphisms twisted;
grassmann graphs;
graph;
twisted grassmann;
core
Journal Title: Graphs and Combinatorics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Graphs and Combinatorics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!