Results 41 to 50 of about 67,630 (266)
Normalized Laplacian Eigenvalues of Hypergraphs
an error is ...
Leyou Xu, Bo Zhou
openaire +2 more sources
For network graphs, numerous graph features are intimately linked to eigenvalues of the Laplacian matrix, such as connectivity and diameter. Thus, it is very important to solve eigenvalues of the Laplacian matrix for graphs.
Changlei Zhan, Xiangyu Li, Jie Chen
doaj +1 more source
Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however, determining analytically Laplacian eigenvalues and eigenvectors is a ...
B. Bollobás +8 more
core +1 more source
Steklov eigenvalues for the $\infty$-Laplacian
We study the Steklov eigenvalue problem for the \infty -laplacian. To this end we consider the limit as p \to \infty of solutions of
Garcia Azorero, Jesus +3 more
openaire +2 more sources
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Novel Concept of Energy in Bipolar Single-Valued Neutrosophic Graphs with Applications
The energy of a graph is defined as the sum of the absolute values of its eigenvalues. Recently, there has been a lot of interest in graph energy research.
Siti Nurul Fitriah Mohamad +3 more
doaj +1 more source
Bounds for eigenvalue ratios of the Laplacian [PDF]
For a bounded domain $\Omega$ with a piecewise smooth boundary in an $n$-dimensional Euclidean space $\mathbf{R}^{n}$, we study eigenvalues of the Dirichlet eigenvalue problem of the Laplacian.
Q. -m. Cheng +3 more
core
On the spectrum of hypergraphs
Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different structural properties
Chris Ritchie (1952305) +4 more
core +3 more sources
A Unifying Approach to Self‐Organizing Systems Interacting via Conservation Laws
The article develops a unified way to model and analyze self‐organizing systems whose interactions are constrained by conservation laws. It represents physical/biological/engineered networks as graphs and builds projection operators (from incidence/cycle structure) that enforce those constraints and decompose network variables into constrained versus ...
F. Barrows +7 more
wiley +1 more source
On the Seidel Laplacian spectrum of threshold graphs [PDF]
A graph which does not contain C4, P4, or 2K2 as its induced subgraphs, is called a threshold graph. In this paper, we consider seidel laplacian matrix of a connected threshold graph and determine the seidel laplacian spectrum. Also, the characterization
Megha P M, Parvathy K S
doaj +1 more source

