The silicates are the largest, the most interesting and the most complicated class of minerals by far. The basic chemical unit of silicates is the (SiO 4 ) tetrahedron. A silicate sheet is a ring of tetrahedrons which are linked by shared oxygen nodes to other rings in a two dimensional plane that produces a sheet-like structure. We consider the silicate sheet as a fixed interconnection parallel architecture and call it a silicate network. The achromatic number for a graph G= (V, E) is the largest integer m such that there is a partition of V into disjoint independent sets (V 1 , ..., V m ) satisfying the condition that for each pair of distinct sets V i , V j , V i ∪ V j is not an independent set in G. In this paper, we determine an approximation algorithm for the achromatic number of Silicate Network which is N P complete even for trees.

No abstract

No abstract

No abstract

No abstract