idkjules7060 idkjules7060
  • 22-08-2019
  • Computers and Technology
contestada

Each vertex in a graph of n bertices can be the origin of at most ____edges

A. n

B.n-1

C.1

D.n+1

Respuesta :

ExieFansler ExieFansler
  • 27-08-2019

Answer:

B. n-1

Explanation:

If there are n vertices then that vertex can be origin of at most  n-1 edges.Suppose that you have a graph with 8 vertices you can select a vertex from these 8 vertices now you have 7 other vertices.So the vertex you selected can have at most 7 edges or it can be origin of at most 7 edges.So we conclude that the answer is n-1.

Answer Link

Otras preguntas

Write the quadratic equation y=(x^2)-6x+7 in vertex form
Which of the following types of economies is most likely to develop new and better products? market command traditional none of the above
1. Ladybugs are crafty creatures, when they feel threatened, they pull their legs and antennae under their shells like a turtle. 2. Ladybugs are crafty creatur
Matt and Mindy each built a rectangular prism that has a lenth of 5 units, a width of 2 units, and a height of 4 units. Matt use cubes that are 1 cm on each sid
What number is 74% of 58
how long is a term for a us senate
What did Texas offer that caused these people to want to move into the area
at which body of water does the Nile river end
put these in order from least to greatest kilometer,millimeter,inches,yards,centimeter,miles,meter
what happens to water once it reaches earths surface