348 views
0 votes
0 votes
Let G be a graph with 100 vertices numbered  from 1 to 100. Two vertices i and j are adjacent if $\left | i-j \right |=8 $  or $\left | i-j \right |=12$

the number of connected components in G are

a)8

b)4

c)12

d)25

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Gate Fever asked Jan 8, 2019
492 views
Assume G is a connected planar graph that has 12 vertices and 17 regions.all interior regions are bounded by a cycle of length 3(ie 3 edge).find the number of edges bound...
0 votes
0 votes
0 answers
2
Gate Fever asked Jan 8, 2019
229 views
consider a simple graph G with k components.If each component has n1,n2,.....nk vertices,then the maximum number of edges in G is
0 votes
0 votes
0 answers
4