can anyone help me with this question....plz:

Determine the number of n-vertex orientated labeled graphs without loops in which every two distinct vertices are connected by at most one (orientated) edge.

thanks