4194
правки
Converse digraph: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Converse digraph''' --- обратный орграф. Let <math>D</math> be a digraph. The '''converse''' of <math>D</math>, denoted <math>D'</math>, is a d…») |
KEV (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Converse digraph''' | '''Converse digraph''' — ''[[обратный орграф]].'' | ||
Let <math>D</math> be a digraph. The '''converse''' of <math>D</math>, denoted <math>D'</math>, is a digraph obtained from <math>D</math> by reversing the direction of each arc of | Let <math>\,D</math> be a [[digraph]]. The '''converse''' of <math>\,D</math>, denoted <math>\,D'</math>, is a digraph obtained from <math>\,D</math> by reversing the direction of each [[arc]] of <math>\,D</math>. A digraph is called '''self-converse''' if it is ''[[isomorphic graphs|isomorphic]]'' to its ''converse''. | ||
<math>D</math>. A digraph is called '''self-converse''' if it is ''isomorphic'' | |||
to its ''converse''. | ==Литература== | ||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
