Combinatorics Graph theory: basic notions Concept
Path
Summary
A path in a graph is a walk that visits each vertex at most once. Paths measure distance and connectivity in graphs. The node path gives the precise definition.
Where this leads
4 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Path_(graph_theory), Walk, trail, and path
About this page
| Tag | 03NAMV1DHJ |
|---|---|
| URI | m2://03NAMV1DHJ |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C38 |
| Specializes | Trail |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.