filmov
tv
Given the relation `R={(1,2),(2,3)}` on the set `A={1,2,3}` the minimum number of ordered pairs
Показать описание
Given the relation `R={(1,2),(2,3)}` on the set `A={1,2,3}` the minimum number of ordered pairs which when added to `R` make it an equivalence relation is
0:03:56
Show that the Relation R in the set {1,2,3} R={(1,2),(2,1)}is symmetric neither reflexive transitive
0:02:48
Given the relation `R={(1,2),(2,3)}` on the set `A={1,2,3}` the minimum number of ordered pairs
0:03:05
Let R be the Relation R in set {1,2,3,4} given by R={(1,2),(2,2),(1,1)(4,4),(1,3),(3,3)(3,2)}.Choose
0:03:05
Show that the relation R in the set `{1, 2, 3}` given by `R = {(1, 2), (2, 1)}` is symmetric but...
0:01:38
The relation R = {(1,1),(2,2),(3,3)} on the set {1,2,3} is
0:04:28
Show that the relation R in the set `{1, 2, 3}`given by `R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)
0:06:59
Composition of Relation with Itself
0:03:27
If a relation R on the set {1,2,3} be defined by R={(1,1)} then R is
0:02:08
The relation `R={(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)}` on a set A={1, 2, 3} is
0:03:52
Show that R is symmetric but neither reflexive nor transitive
0:03:39
A relation R in S={1,2,3} is defined as R= (1,1) (1,2) (2,2) (3,3). which element of relation R be
0:02:01
lf a relation R on the set `{1, 2, 3}` be defined by `R ={(1,2)}`, then R is:
0:06:29
Equivalence Relation
0:05:51
Representation of Relations
0:05:18
Check whether the Relation R in the set {1,2,3,4,5,6} as R={(a,b):b=a+1} is Reflexive, Symmetric or
0:06:39
Types of Relations (Part 1)
0:03:30
Show that the relation R in the set `{1, 2, 3}`given by `R = {(1, 2), (2, 1)}`is symmetric but
0:04:43
Closure of Relations – Part 1
0:10:26
Show that relation R in the setA={1,2,3,4,5} given by elements of {1,3,5} are related to each other
0:00:51
Relations||How to check relation is reflexive, symmetric or transitive?
0:06:53
Relation R in the set A={1,2,3..13,14} defined as R={(x, y):3x-y=0} Reflexive, Symmetric, Transitive
0:07:19
Equivalence Classes
0:09:46
Warshall's Algorithm (Finding the Transitive Closure)
0:02:01
The relation R on the set A = {1, 2, 3} defined as R ={(1, 1), (1, 2), (2, 1), (3, 3)} is reflexive,
Комментарии