Results 71 to 80 of about 67,630 (266)
ABSTRACT This paper proves the existence of nontrivial solution for two classes of quasilinear systems of the type −ΔΦ1u=Fu(x,u,v)+λRu(x,u,v)inΩ−ΔΦ2v=−Fv(x,u,v)−λRv(x,u,v)inΩu=v=0on∂Ω$$ \left\{\begin{array}{l}\hfill -{\Delta}_{\Phi_1}u={F}_u\left(x,u,v\right)+\lambda {R}_u\left(x,u,v\right)\kern0.1832424242424242em \mathrm{in}\kern0.3em \Omega ...
Lucas da Silva, Marco Souto
wiley +1 more source
Quantization of the Laplacian operator on vector bundles I
Let $(E,h)$ be a holomorphic Hermitian vector bundle over a polarized manifold. We provide a canonical quantization of the Laplacian operator acting on sections of the bundle of Hermitian endomorphisms of $E$.
Keller, Julien +2 more
core +2 more sources
Abstract Lung cancer is the leading cause of global cancer‐related morbidity and mortality, with tobacco smoking as its strongest risk factor. Nuclear factor erythroid 2‐related factor 2 (NRF2) is a redox‐regulated transcription factor frequently dysregulated in non‐small cell lung cancer (NSCLC), leading to aggressive disease and resistance to therapy.
Jouni Härkönen +14 more
wiley +1 more source
Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature.
S. N. Daoud
doaj +1 more source
This study presents improvements to the non‐hydrostatic version of the European Centre for Medium‐Range Weather Forecasts (ECMWF) Integrated Forecasting System (IFS), enabling stable global simulations at 1.4‐km resolution. A systematic comparison with the hydrostatic version at resolutions from 9 to 1.4 km shows that non‐hydrostatic effects emerge in ...
Jozef Vivoda +3 more
wiley +1 more source
On Minimum Algebraic Connectivity of Tricyclic Graphs [PDF]
Consider a simple, undirected graph $ G=(V,E)$, where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$. The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectivity of $G$.
Hassan Taheri, Gholam Hossein Fath-Tabar
doaj +1 more source
Estimates for eigenvalues of the Neumann and Steklov problems
We prove Li-Yau-Kröger-type bounds for Neumann-type eigenvalues of the biharmonic operator on bounded domains in a Euclidean space. We also prove sharp estimates for lower order eigenvalues of a biharmonic Steklov problem and of the Laplacian, which ...
Du Feng +4 more
doaj +1 more source
Laplacian eigenvalues of equivalent cographs
Let G and H be equivalent cographs with their reduction R_G and R_H, and suppose the vertices of R_G and R_H are labeled by the twin numbers t_i of the k twin classes they represent. In this paper, we prove that G and H have at least k + \sum_{i\in I}(t_i-1) Laplacian eigenvalues in common, where I is the indices of the twin classes whose types are ...
Lazzarin, J. +2 more
openaire +2 more sources
The integral equation methods for the perturbed Helmholtz eigenvalue problems
It is well known that the main difficulty in solving eigenvalue problems under shape deformation relates to the continuation of multiple eigenvalues of the unperturbed configuration.
Abdessatar Khelifi
doaj +1 more source
A spectral excess theorem for digraphs with normal Laplacian matrices [PDF]
The spectral excess theorem, due to Fiol and Garriga in 1997, is an important result, because it gives a good characterization of distance-regularity in graphs. Up to now, some authors have given some variations of this theorem.
Fateme Shafiei
doaj +1 more source

