Path Graph

by Betascript Publishing
Unfortunately sold out.
However, we are already in the process of restocking.
VAT included - FREE Shipping
Betascript Publishing Path Graph
Betascript Publishing - Path Graph

Do you like this product? Spread the word!


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.

Further information

Number of Pages:
Media Type:
Betascript Publishing

Master Data

Product Type:
Paperback book
Package Dimensions:
0.22 x 0.15 x 0.008 m; 0.195 kg
We use cookies on our website to make our services more efficient and more user-friendly. Therefore please select "Accept cookies"! Please read our Privacy Policy for further information.