Results 161 to 170 of about 1,644,718 (204)

Data-driven analysis of anomalous transport and three-wave-coupling effects in an  E × B plasma. [PDF]

J Elect Propuls
Bayón-Buján B, Bello-Benítez E, Zhou J, Merino M.   +3 more
europepmc   +1 more source

A first look at rocky exoplanets with JWST. [PDF]

Proc Natl Acad Sci U S A
Kreidberg L, Stevenson KB.
europepmc   +1 more source

Interface second harmonic generation enhancement in bulk WS₂/MoS₂ hetero-bilayer van der Waals nanoantennas. [PDF]

Light Sci Appl
Tognazzi A, Franceschini P, Biechteler J, Baù E, Cino AC, Tittl A, De Angelis C, Sortino L.   +7 more
europepmc   +1 more source

Comparison of choriocapillaris perfusion between swept-source optical coherence tomography angiography and spectral-domain optical coherence tomography angiography in five different choriocapillaris slabs in patients with intermediate age-related macular degeneration. [PDF]

Graefes Arch Clin Exp Ophthalmol
Torrell-Belzach N, Souied EH, Le HM, Benlahbib M, Dobbels Z, Gounfle AE, Wang XX, Jung C, Miere A.   +8 more
europepmc   +1 more source

Electron-Energy Dependent Excitation and Directional Far-Field Radiation of Resonant Mie Modes in Single Si Nanospheres. [PDF]

ACS Photonics
Soler T, Akerboom E, Stamatopoulou PE, Sugimoto H, Fujii M, Fiedler S, Polman A.   +6 more
europepmc   +1 more source

Radiation Characterization of Smart Aerogels Based on Hollow VO₂ Particles. [PDF]

Gels
Li X, Qin S, Xie B, Hou T, Wang L, Xie Y, Han M.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Spanning k-trees and distance spectral radius in graphs

Journal of Supercomputing, 2023
Let $k\geq2$ be an integer. A tree $T$ is called a $k$-tree if $d_T(v)\leq k$ for each $v\in V(T)$, that is, the maximum degree of a $k$-tree is at most $k$.
Sizhong Zhou, Jiancheng Wu
semanticscholar   +1 more source

On the spectral radius and the energy of eccentricity matrices of graphs

Linear and multilinear algebra, 2021
The eccentricity matrix of a connected graph G is obtained from the distance matrix of G by retaining the largest distance in each row and each column and setting the remaining entries as 0.
Iswar Mahato, R. Gurusamy, M. Rajesh Kannan, S. Arockiaraj   +3 more
semanticscholar   +1 more source

Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal

International Conference on Information and Knowledge Management, 2021
The spectral radius of the non-backtracking matrix for an undirected graph plays an important role in various dynamic processes running on the graph.
Zuobai Zhang, Zhongzhi Zhang, Guanrong Chen   +2 more
semanticscholar   +1 more source

A note on the ABC spectral radius of graphs

Linear and multilinear algebra, 2020
The ABC matrix of a graph G, recently introduced by Estrada, is the square matrix of order whose -entry is if the ith vertex and the jth vertex of G are adjacent, and 0 otherwise, where is the degree of the ith vertex of G.
Xiaodan Chen
semanticscholar   +1 more source