Results 141 to 150 of about 33,403 (178)

Ultra-wide-field, deep, adaptive two-photon microscopy for multi-scale neuronal imaging. [PDF]

Light Sci Appl
Yang M, Zhou ZQ, Lang S, Zheng H, Chen S, Li T, Stas E, Yu J, Zhang L, Zhang Z, Uzungil V, Liu Q, Huang Y, Lyu J, Li Y, Jia H, Li M, Li X, Li J, Tang Y, Gong Y, Schultz SR.   +21 more
europepmc   +1 more source

An integrated wireless deep-UV sensing system for intelligent early fire detection. [PDF]

Sci Adv
Park T, Oh J, Cho J, Kang S, Gasparini N, Song W, Hur J, Bae G, Oh S, Yoo H.   +9 more
europepmc   +1 more source

Ground User Clustering for Adaptive Multibeam GEO Satellite Networks. [PDF]

Sensors (Basel)
Shehata H, Inaltekin H, Collings IB.
europepmc   +1 more source

Study on the diffusion mechanism of gangue slurry within the rough connected voids in the caving zone. [PDF]

Sci Rep
Wang J, Fan W, Gao R, Zhang Q, Huang P.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shujing Miao, Shuchao Li
exaly   +3 more sources

On the distance spectral radius of trees

Linear and Multilinear Algebra, 2013
In this article, we prove that among trees on n vertices and matching number m, the dumbbell is the unique tree that maximizes the distance spectral radius, which was conjectured by Aleksandar Ilic [Distance spectral radius of trees with given matching number, Discr. Appl. Math. 158 (2010), pp. 1799–1806].
Milan Nath, Somnath Paul
exaly   +2 more sources

On the distance spectral radius and the distance energy of graphs

Linear and Multilinear Algebra, 2011
The D-eigenvalues {μ1, μ2, … , μ p } of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E D (G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E D (G) which improve Indulal's bounds [G ...
Gungor, A. Dilek, Bozkurt, S. Burca
core   +4 more sources

On distance spectral radius of uniform hypergraphs with cycles

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou
exaly   +3 more sources