Results 21 to 30 of about 249,760 (328)
This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a systematic investigation of $T_G$ for trees, cycles, and complete graphs is provided. Motivated by a conjecture of Hibi
Braun, Benjamin, Meyer, Marie
openaire +3 more sources
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
Scaling Laplacian Pyramids [PDF]
Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate when such matrices are scalable, that is when right multiplication by Laurent polynomial diagonal matrices ...
Hur, Youngmi, Okoudjou, Kasso A.
openaire +2 more sources
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
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
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
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
Stochastic Laplacian growth [PDF]
A point source on a plane constantly emits particles which rapidly diffuse and then stick to a growing cluster. The growth probability of a cluster is presented as a sum over all possible scenarios leading to the same final shape. The classical point for the action, defined as a minus logarithm of the growth probability, describes the most probable ...
Alekseev, Oleg, Mineev-Weinstein, Mark
openaire +3 more sources
On Laplacian Equienergetic Signed Graphs
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
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

