Information Technology Reference
In-Depth Information
ce f g
a
1000
b
1000
c
0110
e
0001
f
0001
E
)
=
.
(
d
,
d
This
(
0
,
1
)
-IM has a graph-representation
Now, we illustrate operation
(
◦
,
∗
)
. Let us have graphs
G
and
H
Let us like to add to each of the lower vertices of
G
new graphs with the form
of
H
and let the vertices of these new graphs be the triples
(
b
,
p
,
q
), (
c
,
r
,
s
)
and
(
d
,
t
,
u
)
that will replace vertices
(
x
,
y
,
z
)
, respectively. Then, we obtain the graph
(
,
)
that has the
0
1
-IM-representation
b
x
H
c
x
H
d
x
H
p
y
q
z
r
y
s
z
t
y
q
u
G
(
◦
,
∗
)
⊕
(
max
)
⊕
(
max
)
.
Search WWH ::
Custom Search