In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC(5)C(7) [ p,q] and HC(5)C(7) [ p,q] nanotubes by this program.

Let G= V E be a simple connected graph. The distance between two vertices of G is defined to be the length of the shortest path between the two vertices. There are topological indices assigned to G and based on the distance function which are invariant under the action of the automorphism group of G. Some important indices assigned to G are the Wiener, Szeged, and PI index which we will find th...

A routing R of a given connected graph G of order n is a collection of n(n−1) simple paths connecting every ordered pair of vertices of G. The vertexforwarding index ξ(G,R) of G with respect to R is defined as the maximum number of paths in R passing through any vertex of G. The vertex-forwarding index ξ(G) of G is defined as the minimum ξ(G,R) over all routing R’s of G. Similarly, the edge-for...

The aim of this study was to document the Doppler indices [pulsatility index (PI) and resistance index (RI)] of the uterine arteries in 30 patients who underwent hysteroscopic rollerball endometrial ablation for dysfunctional uterine bleeding by transvaginal pulsed Doppler sonography, and to reveal whether treatment failures (persistent menometrorrhagia) can be predicted by the blood flow chara...

In this paper, an artificial intelligence method particle swarm optimization (PSO) algorithm is presented for determining the optimal PI controller parameters for the indirect control active and reactive power of doubly fed induction generator (DFIG) to ensure a maximum power point tracking of a wind energy conversion system. A digital simulation is used in conjunction with the PSO algorithm to...

Two equal-length strings S and S′ are a parameterized-match (p-match) iff there exists a one-toone function that renames the characters in S to those in S′. Let P be a collection of d patterns of total length n characters that are chosen from an alphabet Σ of cardinality σ. The task is to index P such that we can support the following operations: search(T ): given a text T , report all occurren...

We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph G = (V,E) on n vertices and k numbers ρ1, . . . , ρk. The goal is to partition the graph into k disjoint sets P1, . . . , Pk satisfying |Pi| ≤ ρin so as to minimize the number of edges cut by th...

The hB-pi tree is a multi-attribute index method which combines the hB tree, a multi-attribute access structure and the II-tree, an abstract index with efficient concurrency and recovery methods. The hB-pi tree is a balanced tree and adapts well to different data distributions. Furthermore, the hB-pi tree inherits the efficient concurrency and recovery methods from the II tree. This paper provi...

Reflectance-based vegetation indices can be valuable for assessing crop nitrogen (N) status and predicting grain yield. While proximal sensors have been widely studied in agriculture, there is increasing interest utilizing aerial sensors. Given that few studies compared sensors, the objective of this study was to quantitatively compare sensitivity aerially sensed Normalized Difference Vegetatio...