Let g be a simple graph with n vertices and m edges. (a) how many edges does the complement ğ have? a simple graph is called self-complementary if it is isomorphic to its complement graph. (b) show that if g is self-complementary, then the number of vertices of g is either a multiple of 4, or one plus a multiple of 4. (hint: use (a) to derive an equation involving the number of vertices.)

step-by-step explanation:

pentagon

step-by-step explanation:

the coordinates   a(5, -2), b(3,-1),c(-4,-4) d(-3,8) and e(-1,4) forms the vertices of the polygon when they are connected in order.

in order to classify that which polygon is it with the given coordinates, first count the number of vertices and then count the number of sides it can make with these vertices.

since, the given coordinates have five vertices, therefore, it will make five sides. moreover, pentagon is regular in nature therefore it will be convex.

now, a polygon with five sides is known as pentagon, therefore, the given polygon is the pentagon.

a

step-by-step explanation: