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

How would a booming economy help with the development of a new genre like Rock and Roll?
wjdjjdjsjfjzjjdnjnsnfenndnjjdjfjjfjfjrjrjjff
PLEASE PLEAS HELP I REALLY NEED IT
Your neighbor, Mr. Turner, doesn't think that alternative energy resources like water, wind, or solar are important. He asks, "Why not just do what we have alwa
Helppppppppppppppppppppppppppppppasap
10. A young child is 44 months old. Find the age of the baby in years as a mixednumber in the simplest form.​
Which expression is a sum of a number and a product
How do organisms obtain energy from an ecosystem?
Michelle has four large storage chests in her basement. each storage chest has a base of 8 square feet. Three of the storage chests have a height of 2 feet and
id like to cancel my account