Definition:Link (Graph Theory)

From ProofWiki
Jump to navigation Jump to search

Definition

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.