Please note, due to scheduled maintenance online transactions will not be possible between 08:00 and 12:00 BST, on Sunday 17th February 2019 (03:00-07:00 EDT, 17th February, 2019). We apologise for any inconvenience
Geometrically, a graph is a collection of points (or vertices) together with a set of edges (or curves) each of which joins two distinct vertices of the graph, and no two of which have points in common except possibly end points. Two given vertices of the graph may be joined by no edge or one edge, but may not be joined by more than one edge. From an abstract point of view, a graph G is a collection of elements ﹛x1, x2, …﹜ called points or vertices, together with a second collection of certain pairs (xα, Xβ) of distinct points of G. It is helpful to retain the geometric language, and refer to any pair in as an edge (or a curve) of G that joins the points xα and Xβ.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.