A binary relation r defined on a set a is said to be reflexive if, for every. Web the relation \(v\) is reflexive, because \((0,0)\in v\) and \((1,1)\in v\). Web what is reflexive relation in discrete mathematics? It is clearly symmetric, because \((a,b)\in v\) always.
A binary relation r defined on a set a is said to be reflexive if, for every. Web what is reflexive relation in discrete mathematics? Web the relation \(v\) is reflexive, because \((0,0)\in v\) and \((1,1)\in v\). It is clearly symmetric, because \((a,b)\in v\) always. A binary relation r defined on a set a is said to be reflexive if, for every.
