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.
Depending on the context, a graph or a multigraph may be defined so as to either allow or disallow the presence of loops (often in concert with allowing or disallowing multiple edges between the same vertices):
In a graph with one vertex, all edges must be loops. Such a graph is called a bouquet.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search