Sana Khan posted an Question
September 26, 2020 • 03:51 am 30 points
  • UGC NET
  • Computer Science & Applications

Que. the edge& vertex connectivity of the graph. 5 2 6 8 (g) = 4 k(g) = 4

Que. The edge& vertex connectivity of the graph. 5 2 6 8 (G) = 4 K(G) = 4

1 Answer(s) Answer Now
  • 0 Likes
  • 2 Comments
  • 0 Shares
  • comment-profile-img>
    Nabeela

    please send the full question

    eduncle-logo-app

    how come edge connectivity and vertex connectivity are 4

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