Abstract. For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. Let U1 2k be the graph obtained from C3 by attaching a path of length n− 3 at one vertex. Let U2 2k be the graph obtained from C3 by attaching a pendant edge together with k − 2 paths of length 2 at the same vertex. In this paper, it is proved that U1 2k (resp., U 2 2k) is the unique ...

A k-radius sequence for a graph G is a sequence of vertices of G (typically with repetitions) such that for every edge uv of G vertices u and v appear at least once within distance k in the sequence. The length of a shortest k-radius sequence for G is denoted by fk(G). We give an asymptotically tight estimation on fk(G) for complete bipartite graphs which matches a lower bound, valid for all bi...

the objects can freely move and have no predefined position. The query consists in finding neighbors for a center location and a given radius. Space is discretized in cubic cells. This algorithm introduces a direct spherical indexing that gives the list of all cells making up the query sphere, for any radius and any center location. It can additionally take in account both cyclic and non-cyclic...

BACKGROUND No clinical data for the relationship of pronator quadratus (PQ) muscle to distal radius had been reported. The aim of this study was to investigate the anatomical features of the PQ muscle related to plate osteosynthesis for distal radius fractures in clinical cases. The feasibility of PQ muscle sparing surgery was investigated as well. METHODS Fifty two distal radius fractures (2...

In this paper, the problem of calculating the stress intensity factor (SIF) for an orthotropic thick-walled cylinder with a small radial crack subject to internal pressure is considered. The crack is assumed to be an edge crack on the external radius of the cylinder. The stress intensity factor is calculated by superposition of an uncracked cylinder with uniform stress distribution and a cylind...

This paper presents a theoretical and experimental analysis of the bias in the localization of edges detected from the zeros of the second derivative of the image in the direction of its gradient, such as the Canny edge detector. Its contributions over previous art are: a quantification of the localization bias as a function of the scale σ of the smoothing filter and the radius of curvature R o...

This paper presents bounds for the variation of the spectral radius λ(G) of a graph G after some perturbations or local vertex/edge modifications of G. The perturbations considered here are the connection of a new vertex with, say, g vertices of G, the addition of a pendant edge (the previous case with g = 1) and the addition of an edge. The method proposed here is based on continuous perturbat...