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
What is stack and queue in data structure?
What are the different binary tree traversal techniques?
Which is better stack or queue?
Define a Deque?
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
State the difference between arrays and linked lists?
What is a weighted graph?
What is meant by int?
What is difference between list and array?
How efficient is bubble sort?
What is bubble insertion selection sort?
How to inverting a function in sort and searching?
Is bucket sort stable?
Explain binary searching and Fibinocci search?
Why do we use stacks?