In this paper, we investigate the usage of machine learning in the detection and recognition of double stars. To do this, numerous images including one star and double stars are simulated. Then, 100 terms of Zernike expansion with random coefficients are considered as aberrations to impose on the aforementioned images. Also, a telescope with a specific aperture is simulated. In this work, two k...

A double-star is a tree with exactly two vertices of degree greater than 1. If T is a double-star where the two vertices of degree greater than one have degrees k1+1 and k2+1, then T is denoted by Sk1,k2 . In this note, we show that every double-star with n edges decomposes every 2n-regular graph. We also show that the double-star Sk,k−1 decomposes every 2k-regular graph that contains a perfect...

We present results of a population synthesis study aimed at examining the role of spin-kick alignment in producing a correlation between the spin period of the first-born neutron star and the orbital eccentricity of observed double neutron star binaries in the Galactic disk. We find spin-kick alignment to be compatible with the observed correlation, but not to alleviate the requirements for low...

‎A tree containing exactly two non-pendant vertices is called a double-star‎. ‎Let $k_1$ and $k_2$ be two positive integers‎. ‎The double-star with degree sequence $(k_1+1‎, ‎k_2+1‎, ‎1‎, ‎ldots‎, ‎1)$ is denoted by $S_{k_1‎, ‎k_2}$‎. ‎It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching‎. ‎In this paper‎, ‎we study the $S_{1,2}$-decomposit...