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

Celia and Ryan are starting a nutrition program. Celia currently consumes 1200 calories a day and will increase that number by 100 calories each day. Ryan curre
write this in km 2000m
You have to write 0.63 as a fraction. How do you choose the denominator?
what is the greatest common factor of 78 and 27 ?
A lab technician has 680ml of solution of water and acid, 3% is acid how many millimeters  are acid? water? can someone please explain step by step to solve thi
what is eight decreased by 3 times a number equals 2
A car traveling at 22.4 m/s skids to a stop in 2.55s determine the skidding distance of the car ?
what is eight decreased by 3 times a number equals 2
Convert 11/50 into a decimal
What percent of 240 is 32?