

InterviewSolution
Saved Bookmarks
1. |
A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.(a) Euler path(b) Hamiltonian path(c) Planar graph(d) Path complement graphThe question was asked in homework.Question is from Different Path in a Graph in section Graphs of Discrete Mathematics |
Answer» Right option is (b) Hamiltonian path |
|