A Euclidean graph in three-dimensional space is a pair (V, E), where V is a set of vertices (sometimes called points or nodes) and E is a set of edges (sometimes called bonds or spacers) where each edge joins two vertices. There is a tendency in the polyhedral and chemical literature to refer to geometric graphs as nets (contrast with polyhedral nets), and the nomenclature in the chemical literature differs from that of graph theory.