Let the G be a graph with 100 vertices numbered 1 to 100
Two vertices i and j are adjecnt if | i-j| =8 or | i-j|
=12. The Number of connected components in G is ?
Answer Posted / achintya singhal
good question
there are 4 connected components..
first contains vertices numbered 1, 5, 9,13,17,21,25,29....
second contains 2, 6, 10, 14, 18.......
third one contains 3, 7, 11, 15......
fourth contains 4, 8, 12, 16, 20.......
| Is This Answer Correct ? | 5 Yes | 6 No |
Post New Answer View All Answers
Is complete binary tree?
Is pointer a variable in data structure?
Name few classes that implement collection interface?
What is dequeue in data structure?
What is binary search in data structure?
What do u mean by data type?
What is meant by binary tree?
What is mergesort and hashtable?
What is the difference between 1d and 2d array?
Is binary tree a bst?
Who created quicksort?
How to inverting a function in sort and searching?
What is the minimum number of nodes that a binary tree can have?
Differentiate linear from a nonlinear data structure?
Why do we use a multidimensional array in data structure?