A graph with a finite number of nodes and edges. If it has 
nodes and has no multiple edges
or graph loops (i.e., it is simple),
it is a subgraph of the complete
graph 
.
A graph which is not finite is called infinite. If every node has finite degree, the graph is called locally finite. The Cayley graph of a group with respect to a finite generating set is always locally finite, even if the group itself is infinite.
