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

Related Questions

• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• A connected graph T without any cycles is called _____________.
• 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?
• 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?
• The number of edges in a regular graph of degree d and n vertices is _______.
• The data structure required for Breadth First Traversal on a graph is?
• Which of the following graph traversals closely imitates level order traversal of a binary tree?
• Which of the following statements for a simple graph is correct?