Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1303-3399-7 |
Объём: | 132 страниц |
Масса: | 221 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
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.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.