S. K. Nimbhokar1, Meenakshi Wasadikar1, Madhukar M. Pawar2
1Department of Mathematics, Dr. B. A. M. University, Aurangabad, 431004, India
2Department of Mathematics, S. S. V. P. Science College, Dhule, 424002, India
Tóm tắt
AbstractThe concept of coloring is studied for graphs derived from lattices with 0. It is shown that, if such a graph is derived from an atomic or distributive lattice, then the chromatic number equals the clique number. If this number is finite, then in the case of a distributive lattice, it is determined by the number of minimal prime ideals in the lattice. An estimate for the number of edges in such a graph of a finite lattice is given.
