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 Graph Theory + – Gate Fever 666 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Navneet Kalra commented Jan 8, 2019 reply Follow flag take the example for 15 vertices and find the connected components .you will find a pattern which when u will generalize will give you the answer for 100 components 0 0 replyShare Shubhgupta commented Jan 8, 2019 reply Follow flag its a GATE question check once. answer will be 4(gcd(8,12)). 1 1 replyShare Gate Fever commented Jan 8, 2019 reply Follow flag yes 4 is correct no its not gate previous year 0 0 replyShare Please log in or register to add a comment.