Results 1 to 10 of about 79,415 (208)
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +4 more sources
Automatica, 2019 This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known.
Kazuhiro Sato
openalex +3 more sources
On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with n Vertices and m Pendent Vertices [PDF]
Journal of Applied Mathematics, 2012 Let Φ(G,λ)=det(λIn-L(G))=∑k=0n(-1)kck(G)λn-k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we give four transforms on graphs that decrease all Laplacian coefficients ck(G) and investigate a conjecture A.
Xinying Pai, Sanyang Liu
doaj +2 more sources
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
Graph Laplacian for image deblurring [PDF]
ETNA - Electronic Transactions on Numerical Analysis, 2021 Image deblurring is relevant in many fields of science and engineering. To solve this problem, many different approaches have been proposed and among the various methods, variational ones are extremely popular. These approaches are characterized by substituting the original problem with a minimization one where the functional is composed of two terms ...
Bianchi D. +3 more
openaire +3 more sources
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
Graph Laplacian Mixture Model [PDF]
IEEE Transactions on Signal and Information Processing over Networks, 2020 Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all available data relate to the same graph.
Hermina Petric Maretic, Pascal Frossard
openaire +2 more sources
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 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
Laplacian integral signed graphs with few cycles
AIMS Mathematics, 2023 A connected graph with n vertices and m edges is called k-cyclic graph if k=m−n+1. We call a signed graph is Laplacian integral if all eigenvalues of its Laplacian matrix are integers.
Dijian Wang, Dongdong Gao
doaj +1 more source
Laplacian Fractional Revival on Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as the Hamiltonian. We first give a spectral characterization of Laplacian fractional revival, which leads to a polynomial time algorithm to check this phenomenon and find the earliest time when it occurs.
Chan, Ada +5 more
openaire +3 more sources