Просмотр кода страницы Strong product of graphs

'''Strong product of graphs''' --- сильное произведение графов. 

For given graphs <math>G_{i} = (V_{i},E_{i})</math>, <math>i = 1, \ldots, n</math>, the vertex
set of the product graph <math>G = (V,E)</math> is the Cartesian product of the
vertex sets of the factors <math>G_{i}</math>, i.e. <math>V = \{(a_{1}, \ldots,
a_{n})\}</math>, where <math>a_{i} \in V_{i}</math>. Two vertices <math>\bar{a} = (a_{1},
\ldots, a_{n})</math> and <math>\bar{b} = (b_{1}, \ldots, b_{n})</math> are ''adjacent'' in <math>n</math>-fold ''' strong product''' if and only if
for each <math>i</math>, <math>1 \leq i \leq n</math>, either
<math>(a_{i},b_{i})</math> is an edge in <math>G_{i}</math> or <math>a_{i} = b_{i}</math>.