Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:
https://gateoverflow.in/473/gate-cse-2012-question-38
@y RajuSri
see above sol i have mentioned take cyclic permutation
64.3k questions
77.9k answers
244k comments
80.0k users