13 citations · 28 across the 11 of their papers we have counts for
1 paper · 1 filter
Pablo Torres, Mario Valencia-Pabon
A graph G is said to be {\em hom-idempotent} if there is a homomorphism from G2 to G, and {\em weakly hom-idempotent} if for some n≥1 there is a homomorphism from $G^…