\begin{definition}[Definition:Link (Graph Theory)]
Let $G = \left({V, E}\right)$ be a graph.
A '''link''' is a edge of $G$ which is ''not'' a loop.
That is, a '''link''' is an edge whose endvertices are 
distinct.
When $G$ is not a loop-graph, then ''all'' edges are '''links'''.
Category:Definitions/Graph Theory
Category:Definitions/Loop-Graphs
\end{definition}