Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
self-loops
Description:
Self-loops are graph edges that connect a vertex to itself, studied in network theory and models of network dynamics.
Related topics:
Complex Network Analysis Techniques (15%),
Graph theory and applications (9%),
Quantum Computing Algorithms and Architecture (8%)
Wikidata ID:
wiki/Q512604
OpenAlex ID:
keywords/self-loops
Works count:
457
Citation count:
5,970
Year
Topic
Type