Results 161 to 170 of about 5,965 (204)
Computational study of metal doped coronene quantum dots for formaldehyde sensing and adsorption in medical and environmental applications. [PDF]
Almansour K, Alsaab HO, Pishnamazi M.
europepmc +1 more source
From biogenesis to deep modeling: a holistic review of miRNA-disease prediction computational methods with experimental comparison. [PDF]
Xie S, Law KLE.
europepmc +1 more source
Enhancing energy predictions in multi-atom systems with multiscale topological learning.
Chen D, Wang R, Wei GW, Pan F.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Laplacian Controllability for Graphs with Integral Laplacian Spectrum
Mediterranean Journal of Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Spectrum and Laplacian Spectrum of the Dice Lattice
Journal of Statistical Physics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuli, Yan, Weigen, Tian, Tao
openaire +1 more source
Resistance distance and Laplacian spectrum
Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta), 2003The resistance distance r ij between two vertices v i and v j of a (connected, molecular) graph G is equal to the resistance between the respective two points of an electrical ...
Xiao, WJ, Gutman, I
openaire +2 more sources
SPECTRUM OF THE LAPLACIAN OF COMPACT MANIFOLDS
Acta Mathematica Scientia, 1996The authors prove the following two results: 1. Let \(M\) be a compact, orientable embedded hypersurface of a compact orientable Riemannian manifold \(N\). Suppose that the Ricci curvature of \(N\) is bounded below by a positive number \(k\). Then \(\lambda_1>k/2\), where \(\lambda_1\) is the first Neumann eigenvalue of the Laplacian of \(M\). 2. Let \(
Xu, Senlin +3 more
openaire +2 more sources
The Laplacian Spectrum of a Graph II
SIAM Journal on Discrete Mathematics, 1994Summary: [For Part I see \textit{R. Grone}, \textit{R. Merris} and \textit{V. S. Sunder}, SIAM J. Matrix Anal. Appl. 11, No. 2, 218-238 (1990; Zbl 0733.05060).] Let \(G\) be a graph. Denote by \(D(G)\) the diagonal matrix of its vertex degrees and by \(A(G)\) its adjacency matrix. Then \(L(G) = D(G) -A(G)\) is the Laplacian matrix of \(G\).
Grone, Robert, Merris, Russell
openaire +1 more source

