original_query: What is Euler's handshaking lemma for finite graphs?
query: What is Euler's handshaking lemma for finite graphs?
answer: The provided text does not explicitly state Euler's handshaking lemma.  It only mentions that a certain property (having exactly one vertex of degree one, with all other vertices having degree exactly two) violates the lemma for finite graphs.