OurBigBook
About
$
Donate
Sign in
Sign up
External vertex boundary
(
∂
v
S
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Graph neighbourhood
Created
2026-10-03
Updated
2026-10-14
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
external vertex boundary
of
a
vertex set
S
is
∂
v
S
=
N
(
S
)
∖
S
=
N
[
S
]
∖
S
.
(1)
For
comparisons
at fixed
∣
S
∣
, minimizing
∣
∂
v
S
∣
is equivalent to minimizing
∣
N
[
S
]
∣
.
Ancestors
(6)
Graph neighbourhood
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(12)
Coordinate compression in a product of paths
Coordinate-shift shadow containment
Isoperimetric number of a graph
Past exam of the mathematics course of the University of Cambridge
/
2003
/
iii
/
Paper 13
/
4
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 10
/
1
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2006
/
iii
/
Paper 12
/
2
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2012
/
iii
/
Paper 11
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2013
/
iii
/
Paper 10
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2016
/
iii
/
Paper 109
/
2
/
i
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2019
/
iii
/
Paper 109
/
3
/
Solution
Spanning subgraph
Vertex-isoperimetric inequality in the discrete cube
Synonyms
(1)
codex/vertex-boundary
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