For entire heat transfer practitioners from the last ten years, heat transmission performance in cooling and heating applications has become foremost concern. Hence, research towards innovative heat transference fluids is enormously powerful and stimulating. This study examines flow and thermal management in axisymmetric magneto hydrodynamic Polyethylene glycol (PEG) based hybrid nanofluid flow induced by a swirling cylinder. Flow and heat transfer is analyzed and compared for PEG+ Cu2O + MgO and PEG+Graphene+ Cu + Ag hybrid nanofluid flow. Shooting technique (R-K 4th order) is applied to work out the flow equations numerically. Simulated results are demonstrated via graphs. The computational results are validated with the published research work and found a modest concurrence. The foremost outcome of this investigation is found to be the axial, swirl and radial velocities in hybrid nanofluid are observed to decay with improvement in Reynolds number, nanofluid volume fraction and magnetic parameter. Platelet shaped nanoparticle colloidal suspension exhibit more decaying axial, swirl and radial velocity compared to spherical shaped nanoparticle colloidal suspension. It is detected that heat transmission rate is higher in PEG + Cu2O + MgO Hybrid nanofluid compared with PEG + Graphene + Cu + Ag Hybrid nanofluid. For cooling purpose one can adopt PEG+Cu2O + MgO hybrid nanofluid.
Dominating sets play a vital role in day-to-day life problems. For-providing effective services in a location, central points are to be identified. This can easily be achieved by graph theoretic techniques. Such graphs and relevant parameters are introduced and extensively studied. One such parameter is complementary nil vertex edge dominating set(cnved-set). A vertex edge dominating set(ved-set) of a connected graph G with vertex set V is said to be a complementary nil vertex edge dominating set(cnved-Set) of G if and only if V — D is not a ved-set of G. A cnved-set of minimum cardinality is called a minimum cnved-set(mcnved-set)of G and this minimum cardinality is called the complementary nil vertex-edge domination number of G and is denoted by γcnve(G). We have given a characterization result for a ved-set to be a cnved-set and also bounds for this parameter are obtained.
21 July 2012 in International Journal of Mathematics and Soft Computing
In this paper, we identify a few proper subsets of the vertex set of a non-empty connected graph and study their properties. Further, we obtain some results when the graph is semi-complete.