Gate Solved CS-2002 Question Paper With Solutions Facebook WhatsApp Twitter Pinterest Email Q. 25 Maximum number of edges in a n – node undirected graph without self loops is Answer: (B) Explanation: Learn More: Gate EC-2003 Question Paper With Solutions
