Processing math: 100%
k-regular graph
Set
context
V
,
E
… set
context
k
∈
N
definiendum
⟨
V
,
E
,
ψ
⟩
∈
i
t
(
E
,
V
)
inclusion
⟨
V
,
E
,
ψ
⟩
… undirected graph
for all
v
∈
V
postulate
d
(
v
)
=
k
Discussion
Parents
Subset of
Regular graph
Context
Vertex degree