Is the statement ""For every natural number n ≥ 1 there exists a directed graph of n vertices for which every vertex has an indegree equal to its outdegree"" TRUE or FALSE?
A directed graph (or digraph) is a collection of nodes connected by edges, each of which has a distinct direction.
Edges in directed graphs have a direction. The edges denote a one-way relationship, as each edge may only be crossed in one direction.
False, "For every natural number n ≥ 1 there does not exist a directed graph of n vertices for which every vertex has an indegree equal to its outdegree"
