Consider a directed graph with nodes {1,2,3...n} and include an edge (i,j) whenever i<j.According to me, it should be n(n-1)/2 but the book says it's nC2(combinations).
Total number of edges in the graph
graphs
Did you try working out what n choose 2 evaluates to?