In this paper, we give necessary and sufficient conditions for the existence of equitable partial 4-cycle and 5-cycle systems. Furthermore, we construct equitable partial 4-cycle and 6-cycle systems of Kn,n'

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...

In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...