Ononot — A graph with 5 vertices is called 'complete' if it is K5. Ho

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryeasy

0:00.0

A graph with 5 vertices is called 'complete' if it is $K_5$ . How many paths of length 2 exist in $K_5$ ?