F , H v are considered simple connected graphs on n and m + 1 vertices, is a specified vertex of u 2 … k ∈ . The graph G = [ ] called with pockets, obtained by taking one copy copies then attaching the i th to 1, at In this article, closed-form formulas resistance distance Kirchhoff index in terms

In this paper, an evolutionary clustering technique is described that uses a point symmetry based distance measure. The algorithm is therefore able to detect both convex and non-convex clusters. Kd-tree based nearest neighbor search is used to reduce the complexity of finding the closest symmetric point. The proposed GA with point symmetry distance based (GAPS) clustering technique is compared ...

Selected short distance runners, middle distance runners and long distance runners were subjected to graded exercise on a treadmill. The maximum aerobic power (VO2 max) and other indices related to oxygen transport system viz. heart rate, ventilation volume, breathing reserve, dyspnoeic index, O2 pulse and RQ were recorded at respective VO2 max work loads, and the values were compared. Long dis...

The Wiener index of a graph G is equal to the sum of distances between all pairs of vertices of G, It is known that the Wiener index of a molecular graph correlates with certain physical and chemical properties of a molecule. In the mathematical literature, many good algorithms can be found to eompute the distances m a graph, and these can easily be adapted for the caleulation of the Wiener ind...

A Multidimensional Query Distance Space (MQDS) is introduced for image retrieval. This is a querydependent space whose dimension is defined by the number of query colours. Specifically, the distances of the closest indexed colours to the query colours form a vector which lies in the MQDS. The location of this distance vector within the space and its relation to the origin and equidistant line, ...