For a vertex in a directed graph, the number of tail ends adjacent to a vertex is called the outdegree, denoted by .