past issues

Welcome to IJLERA! International Journal of Latest Engineering Research and Applications

Volume 03 - Issue 06 (June 2018)


Title:
Transport Properties of Oxygenated Ternary Liquid Mixture at Temperature 298.15 K
Authors:
Manish Tiwari, Ghan Shyam Gupta, V. K.Pandey and Rajeev K. Shukla
Source:
International Journal of Latest Engineering Research and Applications, pp 01 - 07, Vol 03 - No. 06, 2018
Abstract:
Density and viscosity were measured for some oxygenated ternary system at 298.15K and atmospheric pressure and further compared with the theoretical results obtained from two models (Bertrand-Acree- Bruchfield and Flory). The properties were fitted to the Redlich-Kister polynomial equation to estimate the binary coefficients and standard errors. The deviation in viscosity was also computed to study the nature and extent of the molecular interactions in the ternary mixtures. Testing of the models for the ternary system showed that a fair agreement is achieved between experimental and theoretical results when they are compared. Conclusively, both theoretical models were consistent with the experimental results.
Keywords:
Bertrand- Acree-Bruchfield , Flory model , Redlich-Kister, Ternary and Viscosity
Download Full Article

Title:
Clique Secure Domination in Graphs under Some Binary Operations
Authors:
Michael P. Baldado, Jr., Grace M. Estrada and Enrico L. Enriquez
Source:
International Journal of Latest Engineering Research and Applications, pp 08 - 14, Vol 03 - No. 06, 2018
Abstract:
Let 𝐺 be a connected simple graph. A nonempty subset 𝑆 of the vertex set 𝑉(𝐺) is a clique in 𝐺 if the graph 〈𝑆〉 induced by 𝑆 is complete. A clique 𝑆 in 𝐺 is a clique dominating set if it is a dominating set. A clique dominating set 𝑆 is a clique secure dominating set in 𝐺 if for every vertex 𝑢∈𝑉 𝐺 ∖𝑆, there exists a vertex 𝑣∈𝑆∩𝑁𝐺(𝑢), such that (𝑆∖ 𝑣 )∪{𝑢} is a dominating set in 𝐺. The clique secure domination number, denoted by 𝛾𝑐𝑙𝑠 𝐺 , is the smallest cardinality of a clique secure dominating set in 𝐺. In this paper, we give the characterization of the clique secure dominating set resulting from the lexicographic and Cartesian products of two graphs and give some important results. Mathematics Subject Classification: 065C69
Keywords:
dominating set, clique dominating set, secure dominating set, clique secure dominating set
Download Full Article