IAE Academy

ISRO CS 2023 Q.42: solution and answer

ISRO 2023 · CSQ.42 · 1 mark · MCQ

42. Which of the following are true?
(i) In a graph G with 'n' vertices and 'e' edges, sum of degrees of vertices = 2*e
(ii) Eccentricity of a connected graph can never be equal to radius of the graph
(iii) Girth of a graph is the total number of edges in the shortest cycle of the graph
(iv) Graph with equal degree for all vertices is multigraph

  1. (A)

    (i), (ii), (iii)

  2. (B)

    (ii), (iii), (iv)

  3. (C)

    (i), (iii), (iv)

  4. (D)

    None of the above

See the question in the paper

Answer and solution

ANSWER

Only statements (i) and (iii) are true, and no option lists exactly these two, so the answer is (d) None of the above.

Official answer: DSource: ISRO's revised and final answer key of 16 February 2024

  1. Statement (i): each edge adds 1 to the degree of each of its two end vertices, so (handshaking lemma). True.

  2. Statement (ii): the radius is the minimum eccentricity over all vertices, so at least one vertex always has eccentricity equal to the radius. For example, in a cycle every vertex has the same eccentricity, which equals the radius. So the claim that eccentricity can never equal the radius is False.

  3. Statement (iii): girth is the length of the shortest cycle, that is, the number of edges in it. True.

  4. Statement (iv): a graph whose vertices all have the same degree is a regular graph. A simple graph such as is regular and has no parallel edges, so it is not a multigraph. False.

  5. The true statements are exactly (i) and (iii).

  6. Options (a), (b) and (c) each include (ii) or (iv), so none of them lists exactly (i) and (iii). The correct choice is (d), None of the above.

KEY IDEA

Handshaking lemma gives degree sum ; the radius is the smallest eccentricity, so some vertex always attains it; girth is the number of edges in the shortest cycle; equal degrees mean a regular graph, not a multigraph.

WATCH OUT FOR

Accepting (iv) because regular graphs sound special, or thinking eccentricity differs from the radius for every vertex. Also picking option (c) without noticing (iv) is false.

From the ISRO CS 2023 paper. Every question of this paper · The full paper (PDF, ISRO) · All 4 ISRO Graph theory questions, with notes

More ISRO Graph theory questions