1294
правки
Complete product: различия между версиями
Материал из WEGA
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Complete product''' --- полное произведение. The '''complete product''' <math>G_{1} \nabla G_{2}</math> of graphs <math>G_{1}</math> and <math…») |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Complete product''' | '''Complete product''' — ''[[полное произведение]].'' | ||
The '''complete product''' <math>G_{1} \nabla G_{2}</math> of graphs <math>G_{1}</math> | The '''complete product''' <math>\,G_{1} \nabla G_{2}</math> of [[graph, undirected graph, nonoriented graph|graphs]] <math>\,G_{1}</math> and <math>\,G_{2}</math> is the graph obtained from the [[union of graphs|''union'' of graphs]] <math>\,G_{1} \cup G_{2}</math> by joining every [[vertex]] of <math>\,G_{1}</math> with every vertex of <math>\,G_{2}</math>. | ||
and <math>G_{2}</math> is the graph obtained from the ''union'' of graphs | |||
<math>G_{1} \cup G_{2}</math> by joining every vertex of <math>G_{1}</math> with every | ==Литература== | ||
vertex of <math>G_{2}</math>. | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
