A graph in which all vertices have equal degree is known as ____

Related Questions

• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• The number of edges in a complete graph of n vertices is
• A graph is a tree if and only if graph is
• A vertex of in-degree zero in a directed graph is called a/an
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• Which data structure is used in breadth first search of a graph to hold nodes?
• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• A ……….. is a graph that has weights of costs associated with its edges.