closed by
130 views
0 votes
0 votes
closed with the note: duplicate of : https://gateoverflow.in/151077/graph-theory
Consider the ordering relation x | y ⊆ N × N over natural numbers N such that x|y iff there exists z ∈ N such that x · z = y. A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It is called a complete lattice if every subset has a least upper bound and greatest lower bound. is it complete lattice or lattice explain?
closed by

Related questions

0 votes
0 votes
1 answer
1
shuham kumar asked Nov 18, 2022
420 views
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
2 votes
2 votes
1 answer
2
jugnu1337 asked Dec 17, 2021
537 views
complete directed graph with 8 vertices has 28 edges this statement is true or falseplese explain?
0 votes
0 votes
0 answers
3
Psnjit asked Jan 20, 2019
191 views
What is the relation between cut set and edge connectivity?
0 votes
0 votes
0 answers
4
adeemajain asked Jan 19, 2019
213 views
whenever cut edges exist, cut vertices also exist because at least one vertex of a cut edge is a cut vertex.I think this is wrong as this statemnt is nit valid for graph...