Euclidean distance matrices (EDM) are symmetric nonnegative with several interesting properties. In this article, we introduce a wider class of called generalized (GEDMs) that include EDMs. Each GEDM is an entry-wise matrix. A not unless it EDM. By some new techniques, show many significant results on can be extended to matrices. These contain about eigenvalues, inverse, determinant, spectral r...

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...