Number of such paths: a path of 3 nodes has 2 endpoints and one middle. Number of such paths in a complete graph of 5 nodes: number of ways to choose 3 distinct nodes: \( inom53 = 10 \), each induces a path unless it's complete or linear.