Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Adjacency listBarycentric subdivisionBiological networkBipartite realization problem

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1,..., Xn of nonnegative independent random… 
Highly Cited
2003
Highly Cited
2003
A general model of web graphs
We describe a very general model of a random graph process whose proportional degree sequence obeys a power law. Such laws have… 
Review
2002
Review
2002
Advances in Instance Selection for Instance-Based Learning Algorithms
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large… 
Highly Cited
2002
Highly Cited
2002
Consolidation and Market Structure in Emerging Market Banking Systems
Highly Cited
2001
Highly Cited
2001
SALSA: the stochastic approach for link-structure analysis
Today, when searching for information on the WWW, one usually performs a query through a term-based search engine. These engines… 
Review
2001
Review
2001
The expressive pattern of laughter
Laughter as a vocal expressive-communicative signal is one of the least understood and most frequently overlooked human behaviors… 
Highly Cited
2000
Highly Cited
2000
Gradations of Democracy? Empirical Tests of Alternative Conceptualizations
measured. Should scholars use intermediate categories to measure differences between democratic and nondemocratic regimes? In a… 
Highly Cited
1998
Highly Cited
1998
Manufacturing cheap, resilient, and stealthy opaque constructs
It has become common to distribute software in forms that are isomorphic to the original source code. An important example is… 
Highly Cited
1994
Highly Cited
1994
The Laplacian Spectrum of a Graph II
Let G be a graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then L(G) = D(G) - A… 
Highly Cited
1984
Highly Cited
1984
Implicit representation of parametric curves and surfaces
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)