Diferencia entre revisiones de «Bucle (teoría de grafos)»

 

[[Image:6n-graph2.svg|thumb|A graph with a loop on vertex 1]]

In [[graph theory]], a '''loop''' (also called a '''self-loop''') is an [[edge (graph theory)|edge]] that connects a [[vertex (graph theory)|vertex]] to itself. A [[Graph (mathematics)#Simple_Graph|simple graph]] contains no loops.