adplus-dvertising
frame-decoration

Question

In a graph if e=[u, v], Then u and v are called

a.

endpoints of e

b.

adjacent nodes

c.

neighbors

d.

all of above

Answer: (d).all of above

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In a graph if e=[u, v], Then u and v are called

Similar Questions

Discover Related MCQs

Q. A connected graph T without any cycles is called

Q. In a graph if e=(u, v) means

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be

Q. Other name for directed graph is ..........

Q. Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

Q. A connected graph T without any cycles is called ........

Q. In a graph if E=(u,v) means ......

Q. Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

Q. Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

Q. For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

Q. An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

Q. A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

Q. The maximum degree of any vertex in a simple graph with n vertices is

Q. The data structure required for Breadth First Traversal on a graph is

Q. In Breadth First Search of Graph, which of the following data structure is used?

Q. For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is

Q. A complete graph can have ...............

Q. Graph traversal is different from a tree traversal, because:

Q. The number of edges in a simple, n-vertex, complete graph is

Q. Graphs are represented using ............