0 the point where two lines join to form an angle, especially the point that is opposite the base of a triangle -- vrchol
1 the highest point of something -- vrchol
the vertex of a curve.
The algorithm may introduce multiple edges, and by a vertex's 'degree' we mean the number of distinct neighbours.
Let us first introduce the smallest cubic graphs, the only two on two vertices.
The network is dynamic in the sense that the vertices join and leave the network.
The network is robust under adversarial deletion of vertices and edges and actively reconnects itself.
Note that if a pair of vertices is joined by two rainbow paths then they have the same length.
By deleting vertices of small degree we can assume that the minimum degree is at least d/2.
To play the game, some number of counters, or pebbles as we shall call them, are distributed over the vertices of the grid.
In we have to take the pairs involving exceptional vertices into account.
