Loop (graph theory)

Known as: Graph loop, Loop, Self-loop 
In graph theory, a loop (also called a self-loop or a "buckle") is an edge that connects a vertex to itself. A simple graph contains no loops… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Consider a weighted undirected graph and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements… (More)
Is this relevant?
2013
2013
As existence result, it is well known that every 3-connected graph G = (V, E) on more than 4 vertices admits a sequence of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
The interactions between the components of complex networks are often directed. Proper modeling of such systems frequently… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Purpose – The purpose of this paper is to demonstrate that process verification has matured to a level where it can be used in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Language usage over computer mediated discourses, such as chats, emails and SMS texts, significantly differs from the standard… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Finite, undirected graphs without self-loops are considered in the paper. The goal is to nd a protocol for local computation… (More)
Is this relevant?
1997
1997
  • Yuval RabaniyBellcore TechnionAbstractIn
  • 1997
In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network, given any collection of packets with a… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex have… (More)
Is this relevant?