recategorized by
334 views
5 votes
5 votes
In an academy $10$ people are there and each one of them has an adversary and no one has more than one adversary. During a meeting all $10$ of them shook hands with everyone else except their adversary. The number of handshakes that took place is ________
recategorized by

2 Answers

5 votes
5 votes
$\binom{10}{2} - \frac{10}{2} = 45 - 5 = 40$

Normally we would have 45 handshakes, but as each person have exactly one adversary, we remove exactly n/2 handshakes from that.

So 40 is correct.
4 votes
4 votes
We can form a graph with $10$ vertices each representing a person. Since each one has exactly one adversary, it forms a $1-1$ correspondence among the $10$ people and excluding the adversaries we can draw $8$ outgoing edges for each of the $10$ vertices representing a given handshake. This will mean a total degree of $10 \times 8 = 80$ and corresponds to $80/2 = 40$ edges which represents $40$ distinct handshakes.
Answer:

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Sep 14, 2020
195 views
If $G$ is a simple graph with $16$ edges and $\overline{G}$ has $12$ edges, how many vertices does the complement graph $\overline{G}$ have?
4 votes
4 votes
1 answer
2
gatecse asked Sep 14, 2020
321 views
The number of possible connected simple graphs with $3$ labelled vertices is ________
1 votes
1 votes
1 answer
3
gatecse asked Sep 14, 2020
128 views
Suppose a simple graph has $45$ edges, $5$ vertices of degree $6$, and all others of degree $5$. How many vertices does the graph have?
3 votes
3 votes
1 answer
4
gatecse asked Sep 14, 2020
158 views
The maximum number of edges in a disconnected graph having $12$ vertices is _______