Results 11 to 20 of about 57,585 (308)
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
We present some estimate of the Laplacian Spectrum and of Topological Invariants for Riemannian manifold with pinched sectional curvature and with non-empty and non-convex boundary with finite injectivity radius. These estimates do not depend directly on
Sabatini Luca
doaj +1 more source
On Laplacian resolvent energy of graphs [PDF]
Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\geq d_{
Sandeep Bhatnagar +2 more
doaj +1 more source
On distance Laplacian energy in terms of graph invariants [PDF]
summary:For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho ^{L}_{1}\geq \rho ^{L}_{2}\geq \cdots \geq \rho ^{L}_{n}$, the distance Laplacian energy ${\rm DLE} (G)$ is defined as ${\rm DLE} (G)=\sum _{i=1}^{n}|\rho ^
Rather, Bilal A. +3 more
core +1 more source
A proof of a trace formula by Richard Melrose
The goal of this article is to give a new proof of the wave trace formula proved by Richard Melrose in an impressive article. This trace formula is an extension of the Chazarain-Duistermaat-Guillemin trace formula (denoted as “CDG trace formula” in this ...
Colin de Verdière Yves
doaj +1 more source
On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph
Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of D are, respectively, defined as L(D)=Deg+(D)−A(D) and Q(D)=Deg+(D)+A(D), where A(D) represents the adjacency matrix and Deg+(D) represents the diagonal matrix whose diagonal elements are the out-degrees of the vertices in D.
Hilal A. Ganie, Yilun Shang
openaire +1 more source
Comparison of Laplacian differential reconstruction of inline holograms recorded at two different wavelengths and distances [PDF]
Paper presented at Biomedical Optics (BIOMED) Miami, Florida, April 11, 2010We record two holograms using two different illuminating wavelengths. Subtracting these holograms, the resulting reconstruction is an approximation to the second order Laplacian
Dayan Li +5 more
core +1 more source
Machine learning methods have greatly changed science, engineering, finance, business, and other fields. Despite the tremendous accomplishments of machine learning and deep learning methods, many challenges still remain. In particular, the performance of machine learning methods is often severely affected in case of diverse data, usually associated ...
Ekaterina Merkurjev +2 more
openaire +3 more sources
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
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
On the Fractional Dunkl Laplacian
In this paper, we present an approach to the fractional Dunkl Laplacian in a framework emerging from certain reflection symmetries in Euclidean spaces. Our main result is pointwise formulas, Bochner subordination, and an extension problem for the fractional Dunkl Laplacian as well.
Fethi Bouzeffour, Wissem Jedidi
openaire +3 more sources

