Prove that there exists a balanced DAG with at least one edge.

I do not how to explain this question properly.Could I explain that if a vertex has an incoming edge to it, it can always have an outgoing edges back,so it is always possible to have any vertex of a graph with the sum of its indegree equal to its sum of outdegree .Therefore there must be a directed graph which is balanced.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.