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: \( inom{5}{3} = 10 \), each induces a path unless it's complete or linear.

Fri, 08 May 2026 10:59:17 +0000

Content under review