Helicopters operations on board ships require special procedures introducing additional limitations known as ship helicopter operational limitations (SHOLs) which are a priority for all navies. This paper presents the main results obtained from the experimental investigation of a simple frigate shape (SFS) which is a typical case of study in experimental and computational aerodynamics. The resu...

Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ $K_n$ in $\mathbb{R}^3$ such that some cycle links a with non-zero linking number. We say are weakly linked if the absolute value number any is $0$ or $1$. Our main result an algebraic characterisation when pair disjointly embedded linked.
 As step towards this result, we show linked, then each contains either vertex common to...

Given two non-empty graphs G, H and a positive integer k, the Gallai–Ramsey number $${\text {gr}}_k(G:H)$$ is defined as minimum N such that for all $$n\ge N$$ , every k-edge-coloring of $$K_n$$ contains either rainbow colored copy G or monochromatic H. In this paper, we got some exact values bounds {gr}}_k(P_5:H) \ (k\ge 3)$$ if general graph star with extra independent edges pineapple.

simple harmonizable processes (shp) introduced by soltani and parvardeh (2006) are a large class of nonstationary processes which includes stationary and periodically correlated (pc) processes. detection and estimation of shp structure are important problems when dealing with nonstationary data. in this paper, we study the spectral properties of simple processes and propose a method to detect a...

this article aims at contrasting aspectual oppositions in english and persian in the context of the novel the old man and the sea, and its translation by daryabandari (1983) as the data. unlike english, in persian perfective and imperfective forms are morphologically marked. while the vast majority of english simple past forms are translated into persian by past perfective forms, only less than...

For a given graph $H$, the Ramsey number $r(H)$ is minimum $N$ such that any 2-edge-coloring of complete $K_N$ yields monochromatic copy $H$. Given positive integer $n$, \emph{fan }$F_n$ formed by $n$ triangles share one common vertex. We show ${9n}/{2}-5\le r(F_n)\le {11n}/{2} + 6$ for $n$. This improves previous best bounds $r(F_n) \le 6n$ Lin and Li \ge 4n+2$ Zhang, Broersma Chen.

In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1 4 ⌊n 2 ⌋ ⌊

Let $$G_S$$ be a graph with loops obtained from G of order n and at $$S \subseteq V(G).$$ In this paper, we establish neccesary sufficient condition on the bipartititeness connected spectrum $${\textrm{Spec}}(G_S)$$ $${\textrm{Spec}}(G_{V(G)\backslash S})$$ . We also prove that for every $$S\subseteq V(G),$$ $${\mathcal E}(G_S) \ge {\mathcal E}(G)$$ when is bipartite. Moreover, provide an ident...