An undirected graph has 8 vertices labelled 1, 2, \dots, 8 and 31 edge

Back to the 2022 paper

Module 5: Graphs and Trees

20222m

An undirected graph has 8 vertices labelled $1, 2, \dots, 8$ and 31 edges. Vertices $1, 3, 5, 7$ have degree 8 and vertices $2, 4, 6, 8$ have degree 7. What is the degree of vertex 8?

(i) 15
(ii) 8
(iii) 5
(iv) 23

Search Google Ask AI

Similar questions

Discrete MathematicsThe number of edges in a regular graph of degree 46 and 8 vertices is (i) 347 (ii) 230 (iii) 184 (iv) 18620222m Design & Analysis of AlgorithmsConsider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three? - (i) 1/8 - (ii) 1 - (iii) 8 - (iv) 820192m Design & Analysis of AlgorithmsThe minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is: - (i) 2 - (ii) 3 - (iii) 4 - (iv) 120232m Design and Analysis of Algorithms The minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is (i) 2 (ii) 3 (iii) 4 (iv) 120222m

PreviousA simple graph can have (i) multiple edges (ii) self-loops (iii) parallel edges (iv) no multiple edges, self-loops and parallel edges NextA graph which has the same number of edges as its complement must have number of vertices congruent to \_\_\_\_\_\_ or \_\_\_\_\_\_ modulo 4 (for integral values of number of edges). (i) 6k, 6k-1 (ii) 4k, 4k+1 (iii) k, k+2 (iv) 2k+1, k

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play