This question is too easy. Normally, I would have rejected it. But, since it is your first question, and it does comply with the other requirements, I'll take it this time.
Orion was a great warrior of ancient times. It was so important in the Greek history that Zeus created a constellation illustrating him in a fight position. The constellation can be modeled as a graph, with its vertex representing the stars and the edges the links that shape the constellation. Based on the image and the statements below and considering the number o vertex N equals to 15 and that a constellation should never contain a self-loop edge, choose the correct alternative. (I) If Orion's belt is removed (the three star in a row at the bottom of the image), then we have a bipartite graph. (II) The sum of the values of the inverse diagonal of the adjacency matrix is always equal to or higher than the main diagonal in the costellations (III) A spaceship would travel among the constellation using each vertex N without repetition if Orion has lost his shield (IV) A spaceship would travel among the constellation using each edge E without repetition if Orion have lost his shield
This question is too easy. Normally, I would have rejected it. But, since it is your first question, and it does comply with the other requirements, I'll take it this time.
ResponderExcluir