Results 31 to 40 of about 73,165 (262)
An eigenvalue optimization problem for Dirichlet-Laplacian with a drift [PDF]
In this paper, we prove a monotonicity result related to the principal eigenvalue for Dirichlet-Laplacian with a drift operator in a punctured ball.
محسن زیوری رضاپور
doaj +1 more source
The Laplacian spread of graphs [PDF]
summary:The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread,
Liu, BoLian +3 more
core +1 more source
Spectral Graph theory has been utilized frequently in the field of Computer Vision and Pattern Recognition to address challenges in the field of Image Segmentation and Image Classification.
Subramaniam Usha +3 more
doaj +1 more source
While progress has been made in design optimization of concentric ring electrodes maximizing the accuracy of the surface Laplacian estimation, it was based exclusively on the negligible dimensions model of the electrode.
Oleksandr Makeyev +5 more
doaj +1 more source
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
In this article, we associate a Hermitian matrix to a multidigraph G. We call it the complex Laplacian matrix of G and denote it by [Formula: see text]. It is shown that the complex Laplacian matrix is a generalization of the Laplacian matrix of a graph.
Sasmita Barik +2 more
doaj +1 more source
Nonnegative solutions of nonlinear fractional Laplacian equations [PDF]
The study of reaction-diffusion equations involving nonlocal diffusion operators has recently flourished. The fractional Laplacian is an example of a nonlocal diffusion operator which allows long-range interactions in space, and it is therefore important
Hollifield, Elliott Z. +1 more
core
The second immanant of some combinatorial matrices [PDF]
Let $A = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$.
R. B. Bapat +1 more
doaj
Cospectral constructions for several graph matrices using cousin vertices
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
Accurate characterization of rail corrugation is essential for the operation and maintenance of urban rail transit. To enhance the representation capability for rail corrugation, this study proposes a sound–vibration feature fusion method based on ...
Yun Liao +4 more
doaj +1 more source
On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Let G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise.
Gholam Hossein Fath-Tabar
doaj +1 more source

