Overcoming Dimensionality Constraints: A Gershgorin Circle Theorem-Based Feature Extraction for Weighted Laplacian Matrices in Computer Vision Applications [PDF]
In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the local and global properties of a complex graph structure within computer vision applications.
Sahaj Anilbhai Patel, Abidin Yildirim
doaj +2 more sources
Weighted Cheeger constant and first eigenvalue lower bound estimates on smooth metric measure spaces
We establish new eigenvalue inequalities in terms of the weighted Cheeger constant for drifting p-Laplacian on smooth metric measure spaces with or without boundary.
Abimbola Abolarinwa +2 more
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks.
Haiqin Liu, Yanling Shao
doaj +1 more source
Interval Oscillation Theorems for the Weighted p-Sub-Laplacian Equation in the Heisenberg Group
In this paper, we derive a Riccati-type inequality in the Heisenberg group Hn. Based on it, some oscillation criteria are established for the weighted p-sub-Laplacian equations in Hn.
Duan Wu, Pengcheng Niu
doaj +1 more source
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +1 more source
An analytical solution to the multicommodity network flow problem with weighted random routing
We derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the non-uniform multicommodity flow problem under weighted random routing. We show the mean load at each node, net of its demand and normalized by its (
Onuttom Narayan, Iraj Saniee
doaj +1 more source
Comparison Theorems on Weighted Finsler Manifolds and Spacetimes with ϵ-Range
We establish the Bonnet–Myers theorem, Laplacian comparison theorem, and Bishop–Gromov volume comparison theorem for weighted Finsler manifolds as well as weighted Finsler spacetimes, of weighted Ricci curvature bounded below by using the weight function.
Lu Yufeng +2 more
doaj +1 more source
In the present paper, we investigate the stability results of positive weak solution for the generalized Fisher–Kolmogoroff nonlinear stationary-state problem involving weighted p-Laplacian operator −d∆P,pu = ka(x)u[ν − υu] in Ω, Bu = 0 on ∂Ω, where ∆P,p
Salah A. Khafagy, Hassan M. Serag
doaj +1 more source
Weak solution for nonlinear degenerate elliptic problem with Dirichlet-type boundary condition in weighted Sobolev spaces [PDF]
In the present paper, we prove the existence and uniqueness of weak solution to a class of nonlinear degenerate elliptic $p$-Laplacian problem with Dirichlet-type boundary condition, the main tool used here is the variational method combined with the ...
Abdelali Sabri +2 more
doaj +1 more source

