LoopFreeGraphQ

LoopFreeGraphQ[g]
yields True if the graph g has no self-loops, and False otherwise.

DetailsDetails

  • A self-loop in a graph is an edge that connects a vertex to itself.
Introduced in 2010
(8.0)