Results 91 to 100 of about 1,624,240 (288)
Three nontrivial solutions for the p-Laplacian Neumann problems with a concave nonlinearity near the origin [PDF]
, 2010 We consider a nonlinear Neumann problem driven by the p- Laplacian, with a right-hand side nonlinearity which is concave near the origin. Using variational techniques, combined with the method of upper-lower solutions and with Morse theory, we show ...
Staicu, Vasile +2 more
core
Epilepsia, EarlyView.Abstract Objective In temporal lobe epilepsy (TLE), patients often present with neurobehavioral comorbidities encompassing affective and cognitive difficulties. Whereas the latter have been related to atypical connectivity of mesiotemporal and frontotemporal circuits, the brain basis of affective symptoms remains incompletely understood.
Fatemeh Fadaie +4 more
wiley +1 more source
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
AKCE International Journal of Graphs and Combinatorics, 2018 In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +1 more source
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Heliyon, 2022 Ganie HA, Shang Y.
europepmc +1 more source
Immersed Boundary Projection Method for Boundaries With Slip Velocities
International Journal for Numerical Methods in Fluids, EarlyView.A formulation of the immersed boundary method for incompressible flow over arbitrarily‐shaped bodies with surface slip described by the Navier boundary condition is presented. The wall slip velocity and the boundary force are determined implicitly through a projection to satisfy both the boundary condition and the divergence‐free condition of the ...
Takehiro Fujii, Takeshi Omori
wiley +1 more source
On distance signless Laplacian spectrum and energy of graphs
Electronic Journal of Graph Theory and Applications, 2018 The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source
Oversampled Graph Laplacian Matrix For Graph Signals
, 2014 Publication in the conference proceedings of EUSIPCO, Lisbon, Portugal ...
Akie Sakiyama, Yuichi Tanaka 0001
openaire +3 more sources
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Journal of Magnetic Resonance Imaging, EarlyView.ABSTRACT Background Type 2 diabetes (T2DM) heightens cognitive impairment risk, yet the mechanisms remain unclear. Hyperglycemia‐induced iron dysregulation in deep gray matter (DGM) nuclei may be a crucial mechanism. Purpose To investigate DGM iron deposition in T2DM using Quantitative Susceptibility Mapping (QSM) and determine its association with ...
Kun Wang +5 more
wiley +1 more source
On the Signless Laplacian ABC-Spectral Properties of a Graph
MathematicsIn the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +1 more source