The eccentricity of a node in a graph is defined as the length of a longest shortest path starting at that node. The eccentricity distribution over all nodes is a relevant descriptive property of the graph, and its extreme values allow the derivation of measures such as the radius, diameter, center and periphery of the graph. This paper describes two new methods for computing the eccentricity d...

The eccentricity distribution of exoplanets is known from radial velocity surveys to be divergent from circular orbits beyond 0.1 au. This is particularly the case for large planets where the radial velocity technique is most sensitive. The eccentricity of planetary orbits can have a large effect on the transit probability and subsequently the planet yield of transit surveys. The Kepler mission...

We consider the problem of constructing a multicast tree that connects a group of source nodes to a group of sink nodes (receivers) and minimizes the maximum end-to-end delay between any pair of source/sink nodes. This is known as the minimum eccentricity multicast tree problem, and is directly related to the quality of service requirements of real multipoint applications. We deal directly with...

This paper presents adaptive algorithms to compensate roll eccentricity perturbations in web transport systems. Roll eccentricity creates tension disturbances whose frequencies may be slowly varying due to the change of radius of the roll. The magnitude and phase of these perturbations are estimated through an adaptive algorithm that cancels the effect of these perturbations. The ability of the...

In this paper, we calculate the eccentric connectivity index and the eccentricity sequence of two infinite classes of fullerenes with 50 + 10k and 60 + 12k (k in N) carbon atoms.

Let G be a connected graph. The eccentricity of path P, denoted by eccG(P), is the maximum distance from P to any vertex in G. In Central (CP) problem, our aim find minimum eccentricity. This problem was introduced Cockayne et al., 1981, study different centrality measures on graphs. They showed that CP can solved linear time trees, but it known NP-hard many classes graphs such as chordal bipar...

5 To be submitted to Paleoceanography. The accuracy of geologic chronologies can, in principle, be improved through 6 orbital tuning, the systematic adjustment of a chronology to bring the as-7 sociated record into greater alignment with an orbitally derived signal. It would 8 be useful to have a general test for the success of orbital tuning, and one pro-9 posal has been that eccentricity ough...