Loop (graph theory)
id:
loop-graph-theory-323-17037410
title:
Loop (graph theory)
text:
In graph theory, a loop 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: Where graphs are defined so as to allow loops and multiple edges, a graph without loops or multiple edges is often distinguished from other graphs by calling it a simple graph.
Where graphs are defined so as to disallow loops and multiple edges, a graph that does have loops
brand slug:
wiki
category slug:
encyclopedia
description:
Edge that connects a node to itself
original url:
https://en.wikipedia.org/wiki/Loop_(graph_theory)
date created:
date modified:
2024-03-26T06:31:53Z
main entity:
{"identifier":"Q512604","url":"https://www.wikidata.org/entity/Q512604"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/28/6n-graph2.svg","width":375,"height":410}
fields total:
13
integrity:
15