. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 539 1. Maximum Oxygen Consumption . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 540 2. Lactate Threshold . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Objectives: Wheelchairs are the prime mobility aid of persons with spinal cord injuries. Manual wheelchair propulsion puts a lot of demand on the cardiopulmonary as well as the skeletal system. The main purpose of the study was to compare the effects of both arm ergometry training and progressive resistance exercise training of upper limbs on resting heart rate and distance covered during wheel...

Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR(G) = ∑ fu,vg V (G)[d(u) +d(v)]R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between u and v. In this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance.

Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and a path. The resistance distance between any two vertices of a wheel and a fan are obtained. The resistances are related to Fibonacci numbers and generalized Fibonacci numbers. The derivation is based on evaluating determinants of submatrices of the Laplacian matrix. A com...

Abstract: Austenitic stainless steels exhibit a low hardness and weak tribological properties. The wear behaviour of austenitic stainless steel AISI 316 was evaluated through the pin on disc tribological method. For investigating the effect of wear on the changes in microstructure and resistance to wear, optical microscopy and scanning electron microscope were used. The hardness of the worn...

We study convergence properties of the resistance distance on random geometric graphs for increasing sample size. It turns out that the suitably scaled resistance distance between two fixed points converges to a non-trivial limit. However, this limit no longer takes into account global properties of the graph, as for example the cluster structure. Quite to the opposite, the limit distance funct...

We show here that the Kirchhoff index of a network is the average of the Wiener capacities of its vertices. Moreover, we obtain a closed-form formula for the effective resistance between any pair of vertices when the considered network has some symmetries which allows us to give the corresponding formulas for the Kirchhoff index. In addition, we find the expression for the Foster’s n-th Formula.

Let G be a weighted graph with Laplacian matrix L and signless Laplacian matrix Q. In this note, block representations for the group inverse of L and Q are given. The resistance distance in a graph can be obtained from the block representation of the group inverse of L.