The paper ‘‘Mean Distance and Minimum Degree,’’ by Mekkia Kouider and Peter Winkler, JGT 25#1 (1997), 95–99 mistakenly attributes the computer program GRAFFITI to Fajtlowitz and Waller, instead of just Fajtlowitz. (Our apologies to Siemion Fajtlowitz.) Note also that one of the ‘‘flaws’’ we note for Conjecture 62 (that it was made for graphs regular of degree d, vice graphs of minimum degree d)...

Bures distance holds a special place among various measures due to its several distinguished features and finds applications in diverse problems quantum information theory. It is related fidelity and, other things, it serves as bona fide measure for quantifying the separability of states. In this work, we calculate exact analytical results mean root square between fixed density matrix random ma...

This chapter presents a method for vote-based 3D shape recognition and registration, in particular using mean shift on 3D pose votes in the space of direct similarity transformations for the first time. We introduce a new distance between poses in this space—the SRT distance. It is left-invariant, unlike Euclidean distance, and has a unique, closed-form mean, in contrast to Riemannian distance,...

background: co-authorship is one of the most tangible forms of research collaboration. a co-authorship network is a social network in which the authors through participation in one or more publication through an indirect path have linked to each other. the present research using the social network analysis studied co-authorship network of 681 articles published in journal of research in medical...

A Radio Heronian Mean Dd-distance Labeling of a connected graph is an injective map from the vertex set N such that for two distinct vertices and , Dd where denotes between Dd-diameter G.