- Computer Science Engineering (CSE)
- Data Structure (DS)
- The number of edges in a complete graph ...

Q. |
## The number of edges in a complete graph of n vertices is |

A. | n(n+1)/2 |

B. | n(n-1)/2 |

C. | n2/2 |

D. | n |

Answer» B. n(n-1)/2 |

View all MCQs in:
Data Structure (DS)

- 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.
- A graph in which all vertices have equal degree is known as ____
- A ……….. is a graph that has weights of costs associated with its edges.
- A graph is a tree if and only if graph is
- 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 vertex of in-degree zero in a directed graph is called a/an
- The number of comparisons done by sequential search is ………………
- How do you count the number of elements in the circular linked list?

Login to Continue

It will take less than 2 minutes

Report MCQ