Is there a classification for a graph with the following properties?
- Every vertex points to some vertex.
The third property necessitates the existence of at least one cycle. All "paths" must eventually lead to a cycle.
I've looked through a glossary of graph theory but haven't found any terms that describe the above.
I can say that the above "is neither injective nor surjective," but I was hoping for a more positively descriptive name.