I bet an interesting graph theory problem would be 'by adding one node to a directed graph, what is the largest number of nodes reachable if you are allowed n o

I bet an interesting graph theory problem would be 'by adding one node to a directed graph, what is the largest number of nodes reachable if you are allowed n outgoing links', and in particular what n needs to be in order to get all of the npm graph.