2 votes 2 votes closed with the note: duplicate Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to 15 30 90 360 Graph Theory discrete-mathematics counting + – set2018 asked Jul 27, 2017 • closed Jul 27, 2017 by set2018 set2018 457 views comment Share Follow See all 2 Comments See all 2 2 Comments reply set2018 commented Jul 27, 2017 reply Follow Share How to solve these type of graph counting problems ? 0 votes 0 votes Tesla! commented Jul 27, 2017 reply Follow Share It is gate 2012 Question please go and refer there and any query ask there only and close this question as duplicate refer https://gateoverflow.in/473/gate2012-38 0 votes 0 votes Please log in or register to add a comment.
