| A digraph is a graph whose sum of the indegrees is equal to the sum of the the outdegrees, which is also equal to the number of edges in a directed graph. So, I would say, yes, an edge whose starting vertex is also the end vertex, should be counted as an indegree. |