Define Outdegree Of A Graph?

1.	Define Outdegree Of A Graph?
Answer» In a DIRECTED GRAPH, for any node v, the NUMBER of edges which have v as their initial node is called the out DEGREE of the node v. In a directed graph, for any node v, the number of edges which have v as their initial node is called the out degree of the node v.

Answer»

In a DIRECTED GRAPH, for any node v, the NUMBER of edges which have v as their initial node is called the out DEGREE of the node v.

In a directed graph, for any node v, the number of edges which have v as their initial node is called the out degree of the node v.

Discussion