q1)

a) Draw a graph with nodes representing the number 1,2.....,10,in which two nodes are connected by an edge if and only if one is a divisor of the other.

b)Draw a graph with nodes representing the number 1,2.....,10,in which two nodes are connected by an edge if and only if they have no common divisor larger than 1.

c) Find the number of edges and the degree in these graphs and check this theorem : in every graph, the number of nodes with odd degree is even.