Results 31 to 40 of about 339,685 (278)
The distance to the Orion Nebula Cluster [PDF]
, 2006 The distance to the Orion Nebula Cluster (ONC) is estimated using the rotational properties of its low-mass pre main-sequence (PMS) stars. Rotation periods, projected equatorial velocities and distance-dependent radius estimates are used to form an ...
Anthony-Twarog +49 more
core +3 more sources
On graft transformations decreasing distance spectral radius of graphs [PDF]
RAIRO - Operations Research, 2021 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. In this paper, we give several less restricted graft transformations that decrease the distance spectral radius, and determine the unique graph with minimum distance spectral radius among home-omorphically irreducible unicylic graphs on n ≥ 6 vertices ...
Yanna Wang, Bo Zhou
openaire +1 more source
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +1 more source
Stellar Parameters for HD 69830, a Nearby Star with Three Neptune Mass Planets and an Asteroid Belt [PDF]
, 2014 We used the CHARA Array to directly measure the angular diameter of HD 69830, home to three Neptune mass planets and an asteroid belt. Our measurement of 0.674+/-0.014 milli-arcseconds for the limb-darkened angular diameter of this star leads to a ...
Beichman, Charles A. +11 more
core +4 more sources
Distance spectral radius of uniform hypergraphs
Linear Algebra and its Applications, 2016 We study the effect of three types of graft transformations to increase or decrease the distance spectral radius of uniform hypergraphs, and we determined the unique $k$-uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.
Hongying Lin, Bo Zhou
openaire +3 more sources
The LuckyCam Survey for Very Low Mass Binaries II: 13 new M4.5-M6.0 Binaries [PDF]
, 2007 We present results from a high-angular-resolution survey of 78 very low mass (VLM) binary systems with 6.0 = 0.15 arcsec/yr. 21 VLM binaries were detected, 13 of them new discoveries. The new binary systems range in separation between 0.18 arcsec and 1.3
Baraffe I. +16 more
core +3 more sources
Photonics, 2021 Partially coherent optical vortices have been applicated widely to reduce the influence of atmospheric turbulence, especially for free-space optical (FSO) communication.
Jiao Wang +5 more
doaj +1 more source
Absolute dimensions of eclipsing binaries. XXIV, The Be star system DW Carinae, a member of the open cluster Collinder 228 [PDF]
, 2006 Context. The study of detached eclipsing binaries which are members of stellar clusters is is a powerful way of determining the properties of the cluster and of constraining the physical ingredients of theoretical stellar evolutionary models.
Clausen, J. V., Southworth, J. (John)
core +1 more source
The young open cluster Trumpler 3 [PDF]
, 2010 We present a photometric and spectroscopic study of the poorly investigated open cluster Trumpler~3. Basic parameters such as the age of $70\pm10$ Myr, the color excess $E(B-V)=0.30\pm0.02$ mag, the distance of $0.69\pm0.03$ kpc and the limiting radius ...
Bukowiecki, L., Maciejewski, G.
core +1 more source
k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj +1 more source