dual graph
A graph derived from some plane graph in such a way that the derived graph has a…A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides.
Значення
значень: 1A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides.
Форми
множина: dual graphs| Однина | dual graph |
|---|---|
| Множина | dual graphs |
правильне