Loop (graph theory)

In graph theory, a loop (also called a self-loop or a "buckle") is an edge that connects a vertex to itself. A simple graph contains no loops. For an undirected graph, the degree of a vertex is equal to the number of adjacent vertices.

 cycle graph theory

Return to the linkmark list.