Combinatorial dual graph, combinatorically dual graph: различия между версиями

Combinatorial dual graph, combinatorically dual graph (посмотреть исходный код)

317 байт добавлено , 1 октября 2014

нет описания правки

4624

правки

@@ Строка 1: / Строка 1: @@
-'''Combinatorial dual graph, combinatorically dual graph''' --- комбинаторно двойственный граф.
+'''Combinatorial dual graph, combinatorically dual graph''' — ''[[комбинаторно двойственный граф]].''
-A graph <math>G</math> is a '''combinatorial dual graph''' to a graph <math>G^{\ast}</math>, if there exists a one-to-one
+A [[graph, undirected graph, nonoriented graph|graph]] <math>\,G</math> is a '''combinatorial dual graph''' to a graph <math>\,G^{\ast}</math>, if there exists a one-to-one mapping <math>\,e: E(G) \rightarrow E(G^{\ast})</math> of the [[edge]] set of <math>\,G</math> onto the edge set of <math>\,G^{\ast}</math> such that <math>\,C</math> is a ''[[circuit]]'' of <math>\,G</math> if and only if <math>\,e(C)</math> is a ''cocircuit'' of <math>\,G^{\ast}</math>.
-mapping <math>e: E(G) \rightarrow E(G^{\ast})</math> of the edge set of <math>G</math> onto
-the edge set of <math>G^{\ast}</math> such that <math>C</math> is a ''circuit'' of <math>G</math> if and only if <math>e(C)</math> is a ''cocircuit'' of <math>G^{\ast}</math>.
+==Литература==
+* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.