We prove that for every k there exists d = d(k) such that every graph of average degree at least d contains a subgraph of average degree at least k and girth at least six. This settles a special case of a conjecture of Thomassen.

the paper presents a mathematical base modeling combined to modified-winding -function-approach (mwfa) for eccentricity fault detection of a round-rotor synchronous machine. for this aim, a 6-pole machine is considered, and the machine inductances are computed by mwfa in healthy and also under eccentricity fault. a numerical discrete-time method has been proposed to machine modeling in voltage-...

Temporal modulation sensitivity functions were measured centrally and at eccentricities of 2.5 degrees, 5 degrees and 10 degrees in the temporal visual field of 12 patients with recovered optic neuritis and in a group of matched normal controls. A circular, spatially uniform stimulus of 1 degree angular subtense was presented with sinusoidal modulation at 5, 8, 14 and 23 Hz. The general pattern...

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

Abstract We introduce a broad class of multi-hooking networks, wherein multiple copies seed are hooked at each step random locations, and the number follows predetermined building sequence numbers. analyze degree profile in networks by tracking two kinds node degrees—the local average specific over time global overall graph. The former experiences phases latter is invariant with respect to type...

The long-term effect of lunisolar perturbations on high-altitude orbits is studied after a double averaging procedure that removes both the mean anomaly of the satellite and that of the moon. Lunisolar effects acting on high-altitude orbits are comparable in magnitude to the Earth’s oblateness perturbation. Hence, their accurate modeling does not allow for the usual truncation of the expansion ...

The adjacent eccentric distance sum index of a graph G is defined as ξsv(G) = ∑ v∈V (G) ε(v)D(v) deg(v) , where ε(v), deg(v) denote the eccentricity, the degree of the vertex v, respectively, and D(v) = ∑ u∈V (G) d(u, v) is the sum of all distances from the vertex v. In this paper we derive some upper or lower bounds for the adjacent eccentric distance sum in terms of some graph invariants or t...

If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.