In a graph G if e=(u,v), then u and v are called ___________.

Related MCQs

• 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 graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• A connected graph T without any cycles is called _____________.
• A vertex of in-degree zero in a directed graph is called a/an
• For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
• 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.
• Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
• What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
• What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?