666 views
0 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.

Position:
Show:

Related questions

0 0 votes
0 0 answers
928
928 views
Gate Fever asked Jan 8, 2019
928 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 0 votes
0 0 answers
492
492 views
Gate Fever asked Jan 8, 2019
492 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 0 votes
0 0 answers
472
472 views
Gate Fever asked Jan 8, 2019
472 views
A graph is said to be 2 colorable if each vertex can be colored either red or blue and no two vertices of the same color are connected by an edge.If some graph is not 2 c...
0 0 votes
0 0 answers
1.4k
1.4k views
Gate Fever asked Jan 7, 2019
1,447 views
Consider the relation R with the following information (A,B,C,D) :-ABCDabz1ebr1adz1edr1afz2efr2find the total number of FD in above relation (ignore the self FD’s X->X,Y-...