Results 1 to 10 of about 6,200 (156)

The Laplacian spectrum of neural networks [PDF]

open access: yesFrontiers in Computational Neuroscience, 2014
The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks.
Siemon ede Lange   +2 more
doaj   +7 more sources

Some results on the Laplacian spectrum

open access: yesComputers and Mathematics With Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhuo Liu, Bolian Liu
exaly   +2 more sources

On some forests determined by their Laplacian or signless Laplacian spectrum

open access: yesComputers and Mathematics With Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zoran Stanić, Slobodan K SIMIĆ
exaly   +3 more sources

On the essential spectrum of the Laplacian and the drifted Laplacian

open access: yesJournal of Functional Analysis, 2014
This paper concerns the $L^2$ essential spectrum of the Laplacian $Δ$ and the drift Laplacian $Δ_f$ on complete Riemannian manifolds endowed with a weighted measure $e^{-f}d\;vol_g$. We prove that the essential spectrum of the drift Laplacian $Δ_f$ is $[0,+\infty) $ provided the Bakry-Émery curvature tensor $Ric_f$ is nonnegative and $f$ has sublinear ...
exaly   +3 more sources

The Laplacian spectrum of a graph

open access: yesComputers and Mathematics With Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

On the Spectrum of Laplacian Matrix [PDF]

open access: yesMathematical Problems in Engineering, 2021
Let G be a simple graph of order n . The matrix ℒ
Akbar Jahanbani   +2 more
openaire   +2 more sources

Spektrum Laplace pada graf kincir angin berarah (Q_k^3)

open access: yesMajalah Ilmiah Matematika dan Statistika, 2022
Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah   +2 more
doaj   +1 more source

Signless normalized Laplacian for hypergraphs

open access: yesElectronic Journal of Graph Theory and Applications, 2022
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Eleonora Andreotti, Raffaella Mulas
doaj   +1 more source

Cospectral constructions for several graph matrices using cousin vertices

open access: yesSpecial Matrices, 2021
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

On distance Laplacian spectrum of zero divisor graphs of the ring $\mathbb{Z}_{n}$

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
For a finite commutative ring $\mathbb{Z}_{n}$ with identity $1\neq 0$, the zero divisor graph $\Gamma(\mathbb{Z}_{n})$ is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices $x$ and $y$ are adjacent if and
S. Pirzada, B.A. Rather, T.A. Chishti
doaj   +1 more source

Home - About - Disclaimer - Privacy