Some special graphs

Complete graph $(K_n)$

Cycle graph $(C_n)$

Wheel graph $(W_n)$

n-cube $Q_n$

Hamilton path/circuit (Qua tất cả các đỉnh)

Hamilton Path is a path which goes through all vertices once.

Hamilton Circuit is a Hamilton Path but it is ended at the beginning vertex.

Identification Sign for some special graphs

Graph $K_n, C_n, W_n,Q_n$ always have Hamilton Circuit.

Graph $K_{n,m}$ has Hamilton path if and only if:

• $|n-m| = 1$
• If $n =m$ then $K_{n,m}$ has Hamilton circuit.

Euler path/circuit (Qua tất cả các cạnh)

Euler path is a path which goes through all edges once.

Euler circuit is a Euler path but it is ended with the beginning vertex.

Identification Sign

If the list of degree of all vertices are even or only has two odd degrees, it will have Euler path.

Euler path has Euler circuit if and only if all of vertices' degree are even.