You are in browse mode. You must login to use MEMORY

level: Level 1

Questions and Answers List

Question	Answer
All the vertices have same degree	Regular Graph
All the vertices are adjacent to each other	Complete Graph
The number of edges incident to the vertex	Degree of a vertex
All the edges are covered exactly once	Euler Path
All the vertices are covered exactly once	Hamiltonian Path
Both Vertex and edge repeated	Walk
Repetition of vertex is allowed but repetition of edges not allowed	Trail
Repetition of vertex is allowed but repetition of edges is not allowed First and the last vertex is same	Circuit
Repitition of Vertices and edges not allowed	Path
Repitition of Vertices and edges not allowed First and the last vertex is same	Cycle
Covered all the edges exactly once First and the last vertex is same	Euler Circuit
Covered all the Vertices exactly once First and the last vertex is same	Hamiltonian Circuit
There is a path from any vertex to any other vertex	Connected Graph