yields True if the graph g has no self-loops, and False otherwise.
Examplesopen allclose all
Basic Examples (2)
Test whether a graph has no self-loops:
LoopFreeGraphQ gives False for a graph with self-loops:
LoopFreeGraphQ works with undirected graphs:
LoopFreeGraphQ gives False for anything that is not a graph without self-loops:
LoopFreeGraphQ works with large graphs:
Properties & Relations (5)
Possible Issues (1)
LoopFreeGraphQ gives False for non-explicit graphs:
Wolfram Research (2010), LoopFreeGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/LoopFreeGraphQ.html.
Wolfram Language. 2010. "LoopFreeGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/LoopFreeGraphQ.html.
Wolfram Language. (2010). LoopFreeGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/LoopFreeGraphQ.html