Respuesta :

There are 595 handshakes at maximum.

What is handshaking lemma?

Every finite undirected graph, the number of vertices that touch an odd number of edges is even.

given that:

Number of participants in a party = 35

Now,  By "handshake lemma":

number of shakes that would be

=n(n-1)2

=35(35-1)/2

=35*34/2

=35*17

= 595

Hence, there are 595 handshakes at maximum.

Learn more about this concept here:

https://brainly.com/question/5334560

#SPJ1

ACCESS MORE