The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

On Graphs Derived from Posets


Affiliations
1 Department of Mathematics, Dr. B. A. M. University, Aurangabad 431004, India
     

   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
Notifications
Font Size


Abstract Views: 350

PDF Views: 0




  • On Graphs Derived from Posets

Abstract Views: 350  |  PDF Views: 0

Authors

M. P. Wasadikar
Department of Mathematics, Dr. B. A. M. University, Aurangabad 431004, India
S. K. Nimbhorkar
Department of Mathematics, Dr. B. A. M. University, Aurangabad 431004, India

Abstract


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.