| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
In graph theory, a graph is Hamiltonian if it contains a path that starts and ends at the same vertex and includes each vertex exactly once. Such a path is called a Hamiltonian cycle.
In group theory, see Hamiltonian group.
Both the Hamiltonian operator in physics and Hamiltonian cycles in graph theory are named after Sir William Rowan Hamilton.
Disambiguation