>In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. When describing a Graph, I generally prefer the term "Node" over the term "vertex". This is pure conjecture as to the reason why, but I imagine it has something to do with this: In fields of study related to Networks and network science (e.g. Internet), the term Node is more often used to describe members of the Network. Whereas in the field of discrete mathematics and pure graph theory, I expect that it is more common to use the term vertex. I came to Graphs through Computer Science, rather than Mathematics, hence the preference for the term "Node". I have come to prefer the term "Edge" over the terms "link" or "line", though I had to sort of train myself to do this. Terms like "link" or "connection" made more sense initially, but I have found that when trying to conceptualize a Graph in the abstract, these terms can cause cognitive interference. The term "Edge" is also used more commonly when describing Graphs, and so if you get used to using the term "link", whenever you need to read about a problem involving a Graph, you have to constantly perform conceptual translation for `link<->edge` which is like running with weights around your ankles. That's how it was for me, anyway. Though I will sometimes refer to the *relationship* between nodes, which is often more of a qualitative evaluation rather than a linear evaluation.