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

What type of music has often been called the only art form to originate in the united states?
which of the following words contributes to the gothic tone of this passage?
How can you create an equivalent equation by using the properties of equality?
When restraining a cat, which of the following is most important to keep in mind ?
A shipment of marbles with a mean diameter of 27 mm and a standard deviation of 0.15 mm is normally distributed. By how many standard deviations does a marble w
Because Brainly is American, i dont know what school level is the equivalent of being year 12 in Australia. Is it college or high school?
Help with Number 7 please! Thanks!
The few sumerians who learn how to write often held high positions in society as what
According to the big bang theory, after the "bang," the universe remained dark until about later, when neutral atoms began to form.
There was some consideration to make George Washington the king of America. This would have made him a(n)