Abstract
A graph is said to be {\em hom-idempotent} if there is a homomorphism from to , and {\em weakly hom-idempotent} if for some there is a homomorphism from to . Larose et al. [{\em Eur. J. Comb. 19:867-881, 1998}] proved that Kneser graphs are not weakly hom-idempotent for , . For , we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) of -stable Kneser graphs and we show that -stable Kneser graphs are not weakly hom-idempotent, for , . Moreover, for , we prove that -stable Kneser graphs are circulant graphs and so hom-idempotent graphs. Finally, for , we show that -stable Kneser graphs are cores, not -critical, not hom-idempotent and their chromatic number is equal to .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.