![triggercell](/avatars/25453.jpg)
triggercell
12.07.2019 •
Mathematics
Does graph a have an euler path or an euler circuit? explain how you know.
does graph b have an euler path or an euler circuit? explain how you know.
does graph b have an euler path or an euler circuit? explain how you know.
Solved
Show answers
More tips
- F Family and Home Why Does God Punish Us Constantly and How Can We Fix It?...
- H Health and Medicine Relieving Swelling in Legs: Causes and Ways to Alleviate the Symptom...
- S Style and Beauty How to Get Rid of a Bruise: Tips and Tricks...
- F Food and Cooking Лечо: вкусное и простое блюдо для любой кухни...
Answers on questions: Mathematics
- M Mathematics (Unit Circle) Jason and his friends are riding on a ferris wheel that has a diameter of 14 meters. The center of the ferris wheel is 12 meters above the ground. What is the height...
- A Advanced Placement (AP) Isla has moved to a large city to start her first job after college. She likes her new apartment and her new work colleagues, but she cannot seem to shake feelings of sadness. Over...
- B Biology Which structure of the nephron reabsorbs the most substances? a. glomerular capsule b. loop of henle c. ascending limb d. collecting duct e. proximal convoluted tubule...
- C Chemistry A piece of cloth was painted with organic dye 28,650 years ago. What percentage of the original carbon-14 in the organic dye remains after all this time...
- S Social Studies During the negotiation process, if you try to save face for your opponent, tend not to be argumentative or insistent when correct, and spend time getting to know your adversary with...
Ответ:
Step-by-step explanation:
A non-directed graph will have an Euler circuit if all vertices have even degree. It will have an Euler path if it has an Euler circuit or if it has two vertices with odd degree (where the path can start and end).
Graph A
4 of the 5 vertices have odd degree. No Euler path, no Euler circuit.
Graph B
All 6 vertices have degree 4. This graph has an Euler path and an Euler circuit.
Graph C
5 of 6 vertices have degree 4, the remaining one has degree 2. This graph has an Euler path and an Euler circuit.
Ответ:
1-7/10=3/10
3/10 of 30 is 9
9 cupcakes will get vanilla icing