we aimed to analyze the range of motion (rom) and internal rotation (ir) and external rotation (er) isokinetic strength according to humeral retroversion of the dominant shoulder.we included 40 elite baseball players in korea (obp group: n=20 players with careers spanning >10 years, age: 19.37±2.21 years, height: 181.00±5.41 cm, weight: 84.58±7.85 kg; bbp group: n=20 players with careers spanni...

Let G be the Cartesian product of a regular tree T and finite connected transitive graph H. It is shown in [4] that Free Uniform Spanning Forest (FSF) this may not connected, but dependence connectedness on H remains somewhat mysterious. We study case when positive weight w put edges H-copies G, conjecture FSF exhibits phase transition. For large enough we show while for wide family T, disconne...

The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...

The pipeline spanning is triggered by the unevenness of seabed. cyclic fatigue loadings from subsequent scouring make be prone to failure which can cause loss integrity and even catastrophic accident. However, probabilistic modeling a free subsea challenging task due its dynamic characteristics uncertain information. This paper proposes methodology that could capture uncertainty time dependence...

In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for undirected weighted graphs, namely Kruskal’s algorithm, and we will study the structure of MSTs obtained for weighted scale free random graphs. This is meant t...

In this paper, we show that for any even integer t ≥ 4, every 3-connected graph with no K3,t-minor has a spanning tree whose maximum degree is at most t − 1. This result is a common generalization of the result by Barnette [1] and the one by Chen, Egawa, Kawarabayashi, Mohar and Ota [4].

Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning F -free subgraph of G with large minimum degree. This problem is wellunderstood if F does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we s...