the first extended zeroth-order connectivity index of a graph   g is defined as 0 1/2 1 ( ) ( ) ,   v   v v g      g d      where   v   (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...

Fuzzy neural network combines the theories of fuzzy logical and neural network, including learning, association, identification, self-adaptation and fuzzy information process. The logic neurons have received much concern all the time as the important components of neural networks. From the models designing to the algorithms studying, there are many achievements. Glorennec[1]proposed a general a...

the telecom services have been recognized the world-over as an important tool for socioeconomic development for a nation and hence telecom infrastructure is treated as a crucial factor to realize the socio-economic objectives in india. accordingly, the department of telecom has been formulating developmental policies for the accelerated growth of the telecommunication services.  bsnl is a wholl...

We show that every planar, 4-connected, K2,5-minor-free graph is the square of a cycle of even length at least six.

solute transport processes are affected by soil pore water velocity distribution. pore size distribution, which can be used to infer pore water velocity distribution, can be estimated from a soil water retention curve (n). in this study, a solute breakthrough curve was simulated using soil hydraulic parameters in four different soils. to evaluate the proposed model, predictions were compared to...

eccentric connectivity index has been found to have a low degeneracy and hence a significantpotential of predicting biological activity of certain classes of chemical compounds. wepresent here explicit formulas for eccentric connectivity index of various families of graphs.we also show that the eccentric connectivity index grows at most polynomially with thenumber of vertices and determine the ...

The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G)  uvE (G ) (du dv  2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.