Search
Now showing items 1-2 of 2
Neighborhood system in concept lattice
(2000)
In this thesis, we apply and generalize the notion of neighborhood system from
topology to study the relation between the concepts in a concept lattice. We classify all
concepts in the concept lattice into various classes ...
Results on perfect graphs
(2000)
The chromatic number of a graph G is the least number of colours that can be assigned
to the vertices of G such that two adjacent vertices are assigned different colours. The
clique number of a graph G is the size of the ...