Information Technology Reference
In-Depth Information
Let us construct a graph, that is a result of operation substitution c
f over
i
h
c
i
f ;
graph C , then we obtain the graph F with IM:
abhdei
a 000100
b 000100
h 000100
d 000011
e 000000
i 000000
and with the form:
In the present case, when both index sets coincide, it is suitable to use notation
c
f .
If we like to unite the graphs E and F , we obtain the following graph with the
form
i
and with
(
0
,
1
)
-IM
cde f gi
a 110000
b 110000
c 001100
d 001101
e 000010
f 000010
h 010000
E
max F
=
.
-IM that is a result of operation termwise multiplication with sub-
operation “max” over
The
(
0
,
1
)
(
0
,
1
)
-IMs E and C is
 
Search WWH ::




Custom Search