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

Convert an acceleration of 5.5 mi/h/s to m/s² . Answer in units of m/s²
Redo, Answers please?
Consider the electron configuration. 1s 2s 2p 3s 3p Which element has this electron configuration?
Which equation represents a line that passes through (–2, 4) and has a slope of ? y – 4 = (x + 2) y + 4 = (x – 2) y + 2 = (x – 4) y – 2 = (x +4)
How do you write 7 multiplied by ten by the power of three and write it in a pattern to find the value of the expression
The length of a rectangle is 6 ft longer than its width. if the perimeter of the rectangle is 32 ft , find its area.
two ways in which agricultural contributes to environmental degradation
a^2 - b^2 / 4 a=5 b=3
When a metalwork artist works the front side of a sheet of metal with a hammer to imprint a texture from below it is called ________?
Please Help.....................................................