Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Path Graph
CHF 57.40
Auf Lager
SKU
AC5CA7RHBEB
1 Verfügbar 
Geliefert zwischen Mo., 19.01.2026 und Di., 20.01.2026
Details
High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a path graph is a particularly simple example of a tree, namely one which is not branched at all, that is, contains only nodes of degree two and one. In particular, two of its vertices have degree 1 and all others (if any) have degree.In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. A path may be infinite, but a finite path always has a first vertex, called its start vertex, and a last vertex, called its end vertex. Both of them are called end or terminal vertices of the path. The other vertices in the path are internal vertices. A cycle is a path such that the start vertex and end vertex are the same. Note that the choice of the start vertex in a cycle is arbitrary.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130333997
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B8mm x T150mm
- Jahr 2010
- EAN 9786130333997
- Format Fachbuch
- ISBN 978-613-0-33399-7
- Titel Path Graph
- Untertitel Path (graph theory), Graph (mathematics), Vertex (graph theory), Algorithm, Graph Theory, Shortest Path proble, Travelling Salesman Problem, Cycle Space, Vector Space, Mathematical Structure
- Gewicht 193g
- Herausgeber Betascript Publishers
- Anzahl Seiten 132
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
