in Graph Theory recategorized by
602 views
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 __________

in Graph Theory recategorized by
by
602 views

1 comment

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
0

1 Answer

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

2 Comments

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
0
ur approach is absolutely correct!
0
0

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true