In this article using the inverse Laplace transform, we show analytical solutions for the generalized mass transfers with (and without) a chemical reaction. These transfers have been expressed as the Couette flow with the ...

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

QSPR study on benzene derivatives have been made using recently introduced topological methodology. In this study the relationship between the Randic' (x'), Balaban (J), Szeged (Sz),Harary (H), Wiener (W), HyperWiener and ...

A quantitative structure-activity relationship (QSAR) study was conducted for the prediction of inhibitory activity of 1-phenyl[2H]-tetrahydro-triazine-3-one analogues as inhibitors of 5-Lipoxygenase. The inhibitory ...

Integrally skinned asymmetric membranes based on nanocompositepolyethersulfone were prepared by the phase separation process using the supercritical CO2 as a nonsolvent for the polymer solution. In present study, the effects ...

Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, ...

The idea of “forcing" has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics ...

In this paper operational matrix of Bernstein Polynomials (BPs) is used to solve Bratu equation. This nonlinear equation appears in the particular elecotrospun nanofibers fabrication process framework. Elecotrospun organic ...

The Harary index H can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms, such that their magnitude decreases with the increasing distance between the ...

The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were ...

In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of ...