SelfLoopsQ[g]
yields True if graph g has self-loops.


SelfLoopsQ
SelfLoopsQ[g]
yields True if graph g has self-loops.
Details and Options
- SelfLoopsQ functionality is now available in the built-in Wolfram Language function LoopFreeGraphQ.
- To use SelfLoopsQ, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Examples
Basic Examples (2)
SelfLoopsQ has been superseded by LoopFreeGraphQ:
See Also
Tech Notes
Related Guides
-
▪
- Graph Properties ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
Text
Wolfram Research (2012), SelfLoopsQ, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/SelfLoopsQ.html.
CMS
Wolfram Language. 2012. "SelfLoopsQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/SelfLoopsQ.html.
APA
Wolfram Language. (2012). SelfLoopsQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/SelfLoopsQ.html
BibTeX
@misc{reference.wolfram_2025_selfloopsq, author="Wolfram Research", title="{SelfLoopsQ}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/SelfLoopsQ.html}", note=[Accessed: 14-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_selfloopsq, organization={Wolfram Research}, title={SelfLoopsQ}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/SelfLoopsQ.html}, note=[Accessed: 14-August-2025]}