Back to the 2022 paper
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) 18620222mDiscrete MathematicsA 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, k20222mDesign & 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) 820192mDesign and Analysis of Algorithms A graph with five nodes is represented using the adjacency list as follows: | | | | | | |---|---|---|---|---| | A | -> | B (10) | C (3) | | | B | -> | C (1) | D (5) | | | C | -> | B (4) | D (8) | E (2) | | D | -> | E (7) | | | | E | -> | D (9) | | | Answer the following: (i) Draw the graph for the above adjacency list. (ii) Write the algorithm for the Breadth-First Traversal (BFS). (iii) Show the BFS traversal of the graph with the starting node as A.20247m
PreviousA simple graph can have (i) multiple edges (ii) self-loops (iii) parallel edges (iv) no multiple edges, self-loops and parallel edgesNextA 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