A thermohydrodynamic (THD) analysis of turbulent flow in journal bearings is presented based on the computational fluid dynamic (CFD) techniques. The bearing has infinite length and operates under incompressible and steady conditions. In this analysis, the numerical solution of Navier-Stokes equations with the equations governing the kinetic energy of turbulence and the dissipation rate, couple...

We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman’s infinitely divisible distribution as a limit. By contrast, the weighted path length to the maximal label needs to be centered and scaled to converge to a standard normal variate in distribution. The exercise shows that path le...

We study weighted path lengths (depths) and distances for increasing tree families. For those subclasses of increasing tree families, which can be constructed via an insertion process, e.g., recursive trees, plane-oriented recursive trees and binary increasing trees, we can determine the limiting distribution which can be characterized as a generalized Dickman’s infinitely divisible distribution.

The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.

The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.