Let G be a complete undirected graph on 6 vertices. If vertices of G are…

PYQ GATE 2012Modified — slightly modified from the official paper; see the solution

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to

  1. A.

    15

  2. B.

    30

  3. C.

    45

  4. D.

    360

Attempted by 485 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…