in Graph Theory
806 views
0 votes
0 votes

explain with example

in Graph Theory
806 views

4 Comments

its a TOSET which is a lattice
0
0
@magma can u explain how you draw this
0
0

S  = (0,1)

SxS  = (0,1) x (0,1)

R = { (0,0) , (0,1) , (1,0) , (1,1)}

Given , (a,b) R (c,d)  if (a<c or (a = c and b <= d))

now you check how many relation are join with the (0,0)

(0,0) --- > [(0,1) , (1,0) , (1,1)] ----- > this  relations are satisfy the above conditions you can check it !

(1,1) --- > No relation satisfy

1,0 --- > only (1,1)

(0,1) ---> (1,0) , (1,1)

from this relation we draw the hasse diagram

you know the concept how to draw hasse diagram right ??

if no then I suggest you to see the video and grab the concept

https://www.youtube.com/watch?v=KVdzsIjLTQk

 

0
0

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true