PGEE 2017

Question

Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y

Which vertex will have highest in degree ?

Comments

vertex 2 , who divides 4,6,8,10,12

Answer 1

12 has highest degree. Edges to 12 are: [2->12, 4->12, 6->12, 12->12]. All other vertices have lower degree.

Comments

I think it vertex 2 which is having highest degree not 12 because 2 divides 4,6,8,10,12

---

answer must be 12 since the  degree in the graph is calculated by the no.of incoming edges with self loop counted twice so degree of 12 is 5 while degree of 2 is 2(since one self loop is counted twice).