LoopFreeGraphQ[g] yields True if the graph g has no self-loops, and False otherwise.
Test whether a graph has no self-loops:
LoopFreeGraphQ gives False for a graph with self-loops:
Graph DirectedEdges AcyclicGraphQ SimpleGraphQ
400+ new features, including the new Wolfram Predictive Interface, social network analysis, enterprise CDF deployment, and more »