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

A soccer player kicks a ball with a speed of 30 m/s at an angle of 10. How long does the ball stay in the air?
what is red snapper? could you help me?
why is gold preferred as a superior metal over silver and bronze?
Which of the number(s) below are potential roots of the function?p(x) = x4 + 22x2 – 16x – 12
Suppose a rocket ship in deep space moves with constant acceleration equal to 9.8 m/s2, which gives the illusion of normal gravity during the flight. (a) If it
Q1. In a 100m track event, the time taken by four runners is 10 sec., 10.2 sec., 10.4 sec and 10.6 sec. Find the ratio of their speed.
what is the abyssal plain?
What is the negative form of Elles y regardent la télé
(1) Glen’s horse, Tipper, grazes lazily in his grassy.In sentence (1), what part of speech is "lazily"? (A)verb (B)adverb (C)adjective
what is elevator music?