OurBigBook
About
$
Donate
Sign in
Sign up
Minimum degree of a graph
(
δ
(
G
)
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Created
2026-09-24
Updated
2026-10-14
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The minimum degree
δ
(
G
)
is the least degree of
a
vertex
of
G
.
The minimum degree is
δ
(
G
)
=
min
v
∈
V
(
G
)
de
g
(
v
)
, the least
degree of a vertex
in the
graph
.
Ancestors
(5)
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(10)
Average degree of a graph
High-minimum-degree multipartite stability subgraph
Minimum degree of an extremal forbidden-subgraph graph
Minimum-degree Ramsey lower bound
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 11
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 11
/
4
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
iii
/
Paper 110
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2018
/
iii
/
Paper 110
/
4
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 122
/
4
/
a
/
Solution
Whitney inequalities for graph connectivity
Synonyms
(1)
codex/minimum-degree
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version