Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Degree (graph theory)

Known as: In degree (graph theory), DEG, In degree 
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
State-of-the-art graph kernels do not scale to large graphs with hundreds of nodes and thousands of edges. In this article we… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [2]. We give a property… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Graph theory in the information age Old and new concentration inequalities A generative model--the preferential attachment scheme… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This study explores the premise that knowledge in new product development proves both a barrier to and a source of innovation. To… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Recently, Barabasi and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These… Expand
  • table I
  • table I
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of… Expand
  • table I
  • table II
Is this relevant?