I know that many types graphs have unique names, ie. a directed graph where each node has exactly one outbound edge is known as a functional graph. Do the graphs with exactly $2$ inbound/outbound edges have a name?
Bonus: If the $2$ inbound/outbound graph is named, is the $n$th inbound/outbound graph named?