Nigar Sultana posted an Question
May 11, 2021 • 17:13 pm 30 points
  • UGC NET
  • Computer Science & Applications

Que. consider a complete undirected graph on 6 vertices. if vertices of g are labeled, the nurmber of ( distinct cycles of length 4 in g is equal to (a) 15 (b)

Que. Consider a complete undirected graph on 6 vertices. If vertices of G are labeled, the nurmber of ( distinct cycles of length 4 in G is equal to (A) 15 (B) 30 (C) 90 (D) 360 Sol. k has 6 vertices. To make cycle of length 4 we need 4 vertices. C, then distinct ways to arrange those 4 vertices is 3! Kn Kn C Crn-1) 2 So, C, x 3! 90 Correct option is (C).

1 Answer(s) Answer Now
  • 0 Likes
  • 4 Comments
  • 0 Shares
whatsapp-btn

Do You Want Better RANK in Your Exam?

Start Your Preparations with Eduncle’s FREE Study Material

  • Updated Syllabus, Paper Pattern & Full Exam Details
  • Sample Theory of Most Important Topic
  • Model Test Paper with Detailed Solutions
  • Last 5 Years Question Papers & Answers