Results 31 to 40 of about 246,310 (302)

A special class of triple starlike trees characterized by Laplacian spectrum

open access: yesAIMS Mathematics, 2021
Two graphs are said to be cospectral with respect to the Laplacian matrix if they have the same Laplacian spectrum. A graph is said to be determined by the Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum.
10.3934/math.2021260   +4 more
doaj   +1 more source

On Laplacian Equienergetic Signed Graphs

open access: yesJournal of Mathematics, 2021
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj   +1 more source

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

Gluon Propagator on Coarse Lattices in Laplacian Gauges [PDF]

open access: yes, 2002
The Laplacian gauge is a nonperturbative gauge fixing that reduces to Landau gauge in the asymptotic limit. Like Landau gauge, it respects Lorentz invariance, but it is free of Gribov copies; the gauge fixing is unambiguous.
A. Cucchieri   +23 more
core   +2 more sources

Isospectral infinite graphs and networks and infinite eigenvalue multiplicities

open access: yesNetworks and Heterogeneous Media, 2009
We considerthe continuous Laplacian on infinite locally finite networks undernatural transition conditions as continuity at the ramificationnodes and Kirchhoff flow conditions at all vertices.
Joachim von Below, José A. Lubary
doaj   +1 more source

The Characterizing Properties of (Signless) Laplacian Permanental Polynomials of Almost Complete Graphs

open access: yesJournal of Mathematics, 2021
Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj   +1 more source

Laplacian Pattern Formation [PDF]

open access: yesEurophysics News, 1988
The formation of snowflakes, viscous fingers and electrodeposits is governed by analogous equations : these structures are all Laplacian patterns. In this paper we review model experiments and computer simulations which are widely used to study diverse morphologies resulting from the motion of unstable interfaces.
Vicsek, Tamás, Kertész, János
openaire   +2 more sources

Numerical Simulation of Higher-Order Nonlinearity of Human Brain Functional Connectivity Using Hypergraph p-Laplacian

open access: yesMathematics, 2021
Unravelling how the human brain structure gives rise to function is a central question in neuroscience and remains partially answered. Recent studies show that the graph Laplacian of the human brain’s structural connectivity (SC) plays a dominant role in
Jichao Ma   +3 more
doaj   +1 more source

Fractional Laplacian pyramids [PDF]

open access: yes2009 16th IEEE International Conference on Image Processing (ICIP), 2009
We provide an extension of the L 2 -spline pyramid (Unser et al., 1993) using polyharmonic splines. We analytically prove that the corresponding error pyramid behaves exactly as a multi-scale Laplace operator. We use the multiresolution properties of polyharmonic splines to derive an efficient, non-separable filterbank implementation.
Delgado-Gonzalo, Ricard   +2 more
openaire   +2 more sources

Discrete Magnetic Laplacian [PDF]

open access: yesCommunications in Mathematical Physics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy