Register

NIELIT 2017 DEC Scientist B - Section B: 23

• retagged by
2,366 views
0 votes
0 votes

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:

  1. $15$
  2. $30$
  3. $56$
  4. $60$
• retagged by
User Avatar

1 Answer

4 votes
4 votes
672 will be the answer

 FROM 8 vertices we can select 5 vertices in 8C5 ways=56 ways

HERE we have to make the CYCLE of length 5 so DISTINCT CYCLE possible =(n-1)!/2 =(5-1)!/2=12

so no of distinct  cycle of length 5=672
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
4 answers
1
admin asked Mar 30, 2020
3,077 views
NIELIT 2017 DEC Scientist B - Section B: 52
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is $n(n-1)/2$ $n^{n-2}$ $nx$ $n$
Let $G$ be a simple undirected graph on $n=3x$ vertices $(x \geq 1)$ with chromatic number $3$, then maximum number of edges in $G$ is$n(n-1)/2$$n^{n-2}$$nx$$n$
User Avatar
0 votes
0 votes
1 answer
2
admin asked Mar 30, 2020
2,697 views
NIELIT 2017 DEC Scientist B - Section B: 15
In how many ways $8$ girls and $8$ boys can sit around a circular table so that no two boys sit together? $(7!)^2$ $(8!)^2$ $7!8!$ $15!$
In how many ways $8$ girls and $8$ boys can sit around a circular table so that no two boys sit together?$(7!)^2$$(8!)^2$$7!8!$$15!$
User Avatar
1 votes
1 votes
4 answers
4
admin asked Mar 30, 2020
963 views
NIELIT 2017 DEC Scientist B - Section B: 46
The number of integers between $1$ and $500$(both inclusive) that are divisible by $3$ or $5$ or $7$ is _________. $269$ $270$ $271$ $272$
The number of integers between $1$ and $500$(both inclusive) that are divisible by $3$ or $5$ or $7$ is _________.$269$$270$$271$$272$
User Avatar
Link Copied!