Let \( \bar{G} \) denote the complement graph of an undirected, loppless graph \( G = (V, E) \), that is, \( \bar{G} \) has the same set of vertices \( V \), but the set of edges in \( \bar{G} \) consists of every pair of vertices from \( V \) that is not included in \( E \).
How can we express the number of edges in \( \bar{G} \) in terms of the sizes \( v = |V| \) and \( e = |E| \) ?
- $$ \frac{2v^2 + 2v + e}{2} $$
- $$ \frac{v^2 - v - 2e}{2} $$
- $$ \frac{2v^2 - v + 2e}{2} $$
- $$ \frac{v^2 + 2v - e}{2} $$
- None of the above
Original idea by: Jader Martins
No comments:
Post a Comment