Use app×
Ask a Question
QUIZARD
QUIZARD
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE

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

← Prev Question Next Question →
0 votes
73.5k views
in Computer by (69.2k points)

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

(A) more than n

(B) more than n+1

(C) more than (n+1)/2

(D) more than n(n-1)/2 

Challenge Your Friends with Exciting Quiz Games – Click to Play Now!

1 Answer

+1 vote
by (70.0k points)
selected by
 
Best answer

Correct option- (D) more than n(n-1)/2

← Prev Question Next Question →

Find MCQs & Mock Test

  1. JEE Main 2026 Test Series
  2. NEET Test Series
  3. Class 12 Chapterwise MCQ Test
  4. Class 11 Chapterwise Practice Test
  5. Class 10 Chapterwise MCQ Test
  6. Class 9 Chapterwise MCQ Test
  7. Class 8 Chapterwise MCQ Test
  8. Class 7 Chapterwise MCQ Test

Related questions

0 votes
1 answer
The number of edges in a simple, n-vertex, complete graph is
asked Jul 23, 2019 in Computer by Rishi98 (69.2k points)
0 votes
1 answer
The spanning tree of connected graph with 10 vertices contains
asked Jul 23, 2019 in Computer by Rishi98 (69.2k points)

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

User Contribution to Sarthaks eConnect
Managed by Sarthaks Digitizing India
...