Results 11 to 20 of about 48,454 (295)
The Laplacian Spread of a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph.
Yi-Zheng Fan +3 more
doaj +3 more sources
São Paulo Journal of Mathematical Sciences, 2018 Spheres can be written as homogeneous spaces $G/H$ for compact Lie groups in a small number of ways. In each case, the decomposition of $L^2(G/H)$ into irreducible representations of $G$ contains interesting information. We recall these decompositions, and see what they can reveal about the analogous problem for noncompact real forms of $G$ and $H$.
Schlichtkrull, Henrik +2 more
openaire +4 more sources
On fractional Laplacians – 3 [PDF]
ESAIM: Control, Optimisation and Calculus of Variations, 2016 For s > −1 we compare two natural types of fractional Laplacians (−\mathrm{\Delta })^{s} , namely, the “Navier” and the “Dirichlet” ones.
MUSINA, Roberta, Nazarov, Alexander I.
openaire +8 more sources
On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]
Czechoslovak Mathematical Journal, 2013 The Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph are the characteristic polynomials of its Laplacian matrix, signless Laplacian matrix and normalized Laplacian matrix, respectively. In this paper, we mainly derive six reduction procedures on the Laplacian, signless Laplacian and normalized Laplacian ...
Jianxi Li, Wai Chee Shiu, Ji Ming Guo
openaire +2 more sources
A special class of triple starlike trees characterized by Laplacian spectrum
AIMS 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 resolvent energy of graphs [PDF]
Transactions on Combinatorics, 2023 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
Communications in Partial Differential Equations, 2014 14 pages; this version is considerably ...
MUSINA, Roberta, Nazarov A. I.
openaire +4 more sources
On Laplacian Equienergetic Signed Graphs
Journal 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)
Majalah 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
Advances in Mathematics, 2009 We develop an arithmetic analogue of elliptic partial differential equations. The role of the space coordinates is played by a family of primes, and that of the space derivatives along the various primes are played by corresponding Fermat quotient operators subjected to certain commutation relations. This leads to arithmetic linear partial differential
Buium, Alexandru, Simanca, Santiago R.
openaire +2 more sources