Ask Question
15 December, 09:37

Goes through every edge exactly one; starts and stops at different places. a Hamiltonian Path b Hamiltonian Circuit c Euler Path d Euler Circuit

+2
Answers (1)
  1. 15 December, 09:47
    0
    D. Euler Circuit.

    Step-by-step explanation:

    An Euler Circuit goes through every edge exactly once; starts and stops at the same vertex.

    According to the Euler's Theorem, A graph has an Euler path if there are two 2-degree vertices without odd degrees and all other vertices have even degrees.

    Mathematically, it is given as;

    V+F=2-E

    where;

    F is the number of faces

    V the number of vertices

    E the number of edges.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Goes through every edge exactly one; starts and stops at different places. a Hamiltonian Path b Hamiltonian Circuit c Euler Path d Euler ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers