If G is a connected graph with vertex set V , then the degree distance of G, D′(G), is defined as ∑ {u,v}⊆V (deg u + deg v) d(u, v), where degw is the degree of vertex w, and d(u, v) denotes the distance between u and v. We prove the asymptotically sharp upper bound D′(G) ≤ 14 nd(n− d) 2 +O(n7/2) for graphs of order n and diameter d. As a corollary we obtain the bound D′(G) ≤ 1 27 n 4 + O(n7/2)...

Energy consumption is an important parameter in the context of the wireless sensor networks (WSNs). Several factors can cause energy over consumption such as mobility, node position (relay or gateway), retransmissions... In this paper, we described a new Energy-Degree Distance(EDD) Clustering Algorithm for the WSNs. A node with higher residual energy, higher degree and closer to the base statio...

The degree distance of a graph which is a degree analogue of the Wiener index of the graph. Let G = TUV C6[2p, q] be the carbon nanotubes covered by C6, formulas for calculating the degree distance of armchair polyhex nanotubes TUV C6[2p, q] are provided. Mathematics Subject Classification: 05C05, 05C12

The subtree transfer (STT) distance is one of the distance metric for comparing phylogenies. Previous work on computing the STT distance considered degree-3 trees only. In this paper, we give an approximation algorithm for the STT distance for degreed trees with arbitrary d and with generalized STT operations. Also, some NP-hardness results related to STT distance are presented.

People maintain larger distances to other peoples' front than to their back. We investigated if humans also judge another person as closer when viewing their front than their back. Participants watched animated virtual characters (avatars) and moved a virtual plane toward their location after the avatar was removed. In Experiment 1, participants judged avatars, which were facing them as closer ...

In this work we correct a calculation made by Albert Einstein that appears in his book titled The Meaning of Relativity (Princeton, 1953), and by means of which he tries to obtain the number of degrees of freedom of a system composed of n particles with fixed relative distances and which are immersed in a three-dimensional space. As a result of our analysis, we develop expressions which yield t...

Total and average distance are not only interesting invariants of graphs in their own right but are also used for studying properties or classifying graphical systems that depend on the number of edges traversed. Recent examples include studies of computer networks [3] and the use of graphical invariants to partially classify the structure of molecules [1]. There have been a number of conjectur...

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)...