The accuracy of somatosensory saccades defined by proprioceptive cues with and without an additional tactile stimulus was investigated over a wide range of stimulus amplitudes in 16 normal subjects. The present results confirm that somatosensory saccades are less accurate and more variable than visual saccades. Accuracy was minimal for saccades directed to hand distances of 40-50 deg and increa...

In this paper, the exact formulae for the generalized degree distance, the degree distance and the reciprocal degree distance of the tensor product of a connected graph and of the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr−1 are obtained. In addition we show that the result given by Wang and Kang [J. Comb. Optim., online June 2014] on the degree distance of the te...

In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n and e, we determine the minimum degree distance of a connected graph of order n and size e.

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degreeweighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming...

For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...

The distance-number of a graph G is the minimum number of distinct edgelengths over all straight-line drawings of G in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distancenumber of trees, graphs with no K− 4 -minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of gr...