Open Access
Subscription Access
Open Access
Subscription Access
On Graphs Derived from Posets
Subscribe/Renew Journal
A graph is associated with a poset. If the set of upper bounds of the set of lower bounds of two elements in a poset is the poset itself then we say that these two elements are adjacent in the graph. Properties of this graph are studied. It is shown that if the chromatic number of the associated graph is finite then the clique number is equal to the chromatic number. Some properties of this graph are obtained.
Keywords
Poset, Graph of a Poset, Coloring of a Poset, Clique Number, Chromatic Number, Annihilator.
Subscription
Login to verify subscription
User
Font Size
Information
Abstract Views: 346
PDF Views: 0