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

Topic mentions per year

Topic mentions per year

1936-2017
010020030019362016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
  • Magnús M. Halldórssonz, Jaikumar Radhakrishnanx
  • 2011
The minimum-degree greedy algorithm, or Greedy for short, is a simple and well studied method for nding independent sets in… (More)
Is this relevant?
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
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
There is a large, popular, and growing literature on “scale-free networks” with the Internet along with metabolic networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
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
1995
Highly Cited
1995
Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the… (More)
  • figure 3
Is this relevant?