It may also be an entire graph consisting of edges without common vertices.

The five even-numbered faces meet at the common vertex of their long edges.

In graph theory, a matching is a set of edges without common vertices.

The board is two triangles joined together at a common vertex.

A line also dissects both triangles across their lengths through the common vertex.

The only vacant point is the common vertex which is also the middle point of the board.

It is two triangles connected together at a common vertex.

It consist of two triangles connected together at a common vertex.

Here, two edges are considered to be adjacent when they share a common vertex.

Three such pentagons can easily fit at a common vertex, but a gap remains between two edges.