A vertex of degree one is called __________.

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 vertex of in-degree zero in a directed graph is called a/an
• What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
• ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• A graph with all vertices having equal degree is known as a
• What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
• Maximum degree in any vector in a graph with n vertices is ________.