In particular, the relation → on graphs is transitive (and reflexive, trivially), so it is a preorder on graphs.
Graph homomorphisms also form a category, with graphs as objects and homomorphisms as arrows.