0 votes 0 votes The number of edges in a complete graph of n vertices is (A) n (B) n(n – 1)/2 (C) n(n + 1)/2 (D) (n^2)/2 Graph Theory ugcnetcse-dec2009-paper2 graph-theory + – rishu_darkshadow asked Sep 17, 2017 • recategorized Oct 5, 2018 by Pooja Khatri rishu_darkshadow 833 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes A complete graph Kn will have n(n-1)/2 edges, where n is no of vertices Harish Karnam answered Sep 17, 2017 • selected Sep 17, 2017 by srestha Harish Karnam comment Share Follow See all 0 reply Please log in or register to add a comment.