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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Contents Preface vii Chapter 1. Graph Theory in the Information Age 1 1.1. Introduction 1 1.2. Basic definitions 3 1.3. Degree… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Although the “scale-free” literature is large and growing, it ives neither a precise definition of scale-free graphs no r rig… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider a family of random graphs with a given expected degree sequence. Each edge is chosen independently with probability… (More)
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Recently, Barabási and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a… (More)
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… (More)
  • table I
  • table I
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree… (More)
Is this relevant?