Combinatorial dual graph, combinatorically dual graph

Материал из WikiGrapp
Перейти к:навигация, поиск

Combinatorial dual graph, combinatorically dual graphкомбинаторно двойственный граф.

A graph \,G is a combinatorial dual graph to a graph \,G^{\ast}, if there exists a one-to-one mapping \,e: E(G) \rightarrow E(G^{\ast}) of the edge set of \,G onto the edge set of \,G^{\ast} such that \,C is a circuit of \,G if and only if \,e(C) is a cocircuit of \,G^{\ast}.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.