Results 31 to 40 of about 302,460 (378)
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
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
Fractional Laplacians on ellipsoids
Mathematics in Engineering, 2021 6 pictures, 27 ...
Abatangelo N., Jarohs S., Saldana A.
openaire +6 more sources
Spectral threshold dominance, Brouwer's conjecture and maximality of Laplacian energy [PDF]
, 2015 The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be attained for ...
Helmberg, Christoph, Trevisan, Vilmar
core +3 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
Journal 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
Multiorder Laplacian for synchronization in higher-order networks
Physical Review Research, 2020 Traditionally, interaction systems have been described as networks, where links encode information on the pairwise influences among the nodes. Yet, in many systems, interactions take place in larger groups.
M. Lucas, G. Cencetti, F. Battiston
semanticscholar +1 more source
Random Walks on Simplicial Complexes and the normalized Hodge Laplacian [PDF]
SIAM Review, 2018 Using graphs to model pairwise relationships between entities is a ubiquitous framework for studying complex systems and data.
Michael T. Schaub +4 more
semanticscholar +1 more source
Journal of Nonlinear Mathematical Physics, 2005 We consider some lattices and look at discrete Laplacians on these lattices. In particular we look at solutions of the equation $\triangle(1) = \triangle(2)Z$ where $\triangle(1)$ and $\triangle(2)$ are two such laplacians on the same lattice. We discuss solutions of this equation in some special cases.
openaire +3 more sources