Path . graph theory
Set
| context | V,E … set |
| definiendum | ⟨V,E,ψ⟩∈it(E,V) |
| postulate | ⟨V,E,ψ⟩ … simple graph |
| range | u,v∈V |
| range | a … sequence in V |
| range | i∈N |
| postulate | d(v)≠0 |
| postulate | ∃a. ∀u,v. (∃i. {ai,ai+1}={u,v})↔({u,v}…edge) |
Discussion
A path is a graph which can fully be described by a sequence of vertices.
Theorems
The only paths which are non-bipartite are cycles of odd order.
Parents
Subset of
Context
