GATE CSE Graphs & Graph Algorithms – Data Structures Practice Test | Set 1

Questions 86-90 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 86

NAT · Numerical Answer 1 mark

An undirected graph G has 15 vertices and 20 edges. What is the sum of the degrees of all vertices in G?

Answers for question 86

Question 87

NAT · Numerical Answer 1 mark

Calculate the total number of edges in a complete undirected graph $K_{8}$ with 8 vertices.

Answers for question 87

Question 88

NAT · Numerical Answer 2 mark

How many distinct spanning trees can be formed from a complete labeled graph $K_{5}$ (using Cayley's Formula)?

Answers for question 88

Question 89

NAT · Numerical Answer 2 mark

A simple undirected connected planar graph has 10 vertices and 15 edges. How many faces (regions) does it divide the plane into?

Answers for question 89

Question 90

NAT · Numerical Answer 1 mark

What is the maximum number of edges in a simple bipartite graph with 12 vertices?

Answers for question 90
Scroll to Top