0 votes 0 votes Let N1 be the number of distinct cycles of length 3 in given graph and N2 be the number of distinct cycles of length 3, if the graph is labelled. Then N2 - N1 is __________ Graph Theory graph-connectivity + – sh!va asked Feb 7, 2017 recategorized Jun 20, 2022 by Arjun sh!va 582 views answer comment Share Follow See 1 comment See all 1 1 comment reply bad_engineer commented Feb 7, 2017 reply Follow Share out of 5 vertices we have to select 3 vertices to make a cyclw of lenght 3 So 5C3 for unlabbleled nodes if nodes are labelled then 5C3 * 3 30 - 10 =20 Am I rt???? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes There are total 10 triangles of length 3 unlabeled cycles :10(N1) labeled cycle :3*10(N2) N2-N1=30-10=20 Smriti012 answered Feb 7, 2017 Smriti012 comment Share Follow See all 2 Comments See all 2 2 Comments reply smartmeet commented Feb 7, 2017 reply Follow Share what about 4 and 5 vertex cycle? Can you checkout this and correct me? https://gateoverflow.in/105343/how-many-maximum-cycles-possible-complete-graph-check-answer 0 votes 0 votes Smriti012 commented Feb 7, 2017 reply Follow Share ur approach is absolutely correct! 0 votes 0 votes Please log in or register to add a comment.