edited by
74 views

2 Answers

1 votes
1 votes
A complete graph of $10$ vertices will have $10 \times 9/2 = 45$ edges. Since $G$ has $11$ edges, complement of $G$ will have $45-11 = 34$ edges.
1 votes
1 votes
Given that, simple graph $G$ has $n = 10$ vertices, $e = 11$ edges.

Let say, the number of edges in the complement of $G$ is $x.$

We know that, $e + x = \;^{n}C_{2}$

$\implies e + x = \dfrac{n(n-1)}{2}$

$\implies 11 + x = \dfrac{10\cdot 9}{2} = 45$

$\implies x = 45 – 11 = 34.$

Hence, he number of edges in the complement of $G$ is $x = 34$ edges.

So, the correct answer is $34.$
Answer:

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Aug 30, 2020
151 views
Consider the following array of elements being sorted by merge sort. The sum of all the elements to which $13$ gets compared is _____$$14\; 13\; 24\; 56\; 87\; 98\; 4\; 6...
1 votes
1 votes
1 answer
2
gatecse asked Aug 30, 2020
72 views
For the input $A = 11$ and $B = 10,$ the value of $F_1 \oplus F_2 \oplus F_3 = $ ($\oplus$ being the XOR operations)
1 votes
1 votes
1 answer
3
gatecse asked Aug 30, 2020
130 views
If the values printed by the following C code are $a$ and $b,$ $a + b =$ _____#include<stdio.h int main() { int array[5] = {1, 2, 3, 4, 5}; int *p = array; printf("%ld\t%...
1 votes
1 votes
1 answer
4
gatecse asked Aug 30, 2020
67 views
What will be the output of the following C code?#include<stdio.h int main() { int array[4] = {1, 2, 3, 4}; printf("%d\n", *array + array[0] + *array+1 + array[array ]); }...