A vertex of in-degree zero in a directed graph is called a/an

Related MCQs

• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
• With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
• What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A graph is a tree if and only if graph is
• A vertex of degree one is called __________.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.