Processing math: 100%
Simple graph
Set
context
V
,
E
… set
definiendum
⟨
V
,
E
,
ψ
⟩
∈
i
t
(
E
,
V
)
postulate
⟨
V
,
E
,
ψ
⟩
… loopless graph
postulate
ψ
… injective
Discussion
Two vertices
{
u
,
v
}
of a a simple graph are connected by at most one edge.
Parents
Subset of
Loopless graph
Log In
Article
Read
Search
Log In
Log In
Improvements of the human condition
Graphxioms
