A path in graph G, which contains every vertex of

0

A path in graph G, which contains every vertex of G once and only once ?
a. Eulertour
b. Hamiltonian Path
c. Euler trail
d. Hamiltonian tour

Ravi Garg edited question
    0
    Sonali Kapoor (anonymous)

    correct option B

    Sonali Kapoor answered
      Add image to editor add image from link

      Question stats

      • Active
      • Views216 times
      • Answers1 answer
      • Followers1 follower
      Question and answer is powered by AnsPress