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

Options
- greater than n–1
- less than n(n–1)
- greater than n(n–1)/2
- less than n2/2

CORRECT ANSWER : greater than n–1

Discussion Board
Graph theory

greater than n(n-1)/2

Arsalan 08-23-2021 05:38 AM

Data Structure - Graphs

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

Prajakta Pandit 02-1-2017 07:06 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲