Results 181 to 190 of about 120,979 (218)

On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph

2017
In a simple graph, Laplacian matrix and signless Laplacian matrix are derived from both adjacency matrix and degree matrix. Although, determinant of Laplacian matrix is always zero, yet we express it using only the adjacency matrix and square of its adjacency matrix.
Olayiwola Babarinsa, Hailiza Kamarulhaili   +1 more
openaire   +1 more source

Zeon Matrix Inverses and the Zeon Combinatorial Laplacian

Advances in Applied Clifford Algebras, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Orthogonal Eigenvector Matrix of the Laplacian

2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), 2015
The orthogonal eigenvector matrix Z of the Laplacian matrix of a graph with N nodes is studied rather than its companion X of the adjacency matrix, because for the Laplacian matrix, the eigenvector matrix Z corresponds to the adjacency companion X of a regular graph, whose properties are easier.
Xiangrong Wang, Piet Van Mieghem
openaire   +1 more source

Conjugate Laplacian matrices of a graph

Discrete Mathematics, Algorithms and Applications, 2018
Let [Formula: see text] be a simple graph of order [Formula: see text] Let [Formula: see text] and [Formula: see text] where [Formula: see text] and [Formula: see text] are two nonzero integers and [Formula: see text] is a positive integer such that [Formula: see text] is not a perfect square. In [M.
BÜYÜKKÖSE, ŞERİFE, Kabatas, Ulkunur
openaire   +2 more sources

Learning Laplacian Matrix from Bandlimited Graph Signals

ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019
In this paper, we present a method for learning an underlying graph topology using observed graph signals as training data. The novelty of our method lies on the combination of two assumptions that are imposed as constraints to the graph learning process: i) the standard assumption used in the literature that signals are smooth with respect to graph ...
Batiste Le Bars, Pierre Humbert, Laurent Oudre, Argyris Kalogeratos   +3 more
openaire   +1 more source

Principal subpermanents of the Laplacian matrix

Linear and Multilinear Algebra, 1986
The subdeterminants of the Laplacian matrix L(G) assigned to a graph G have a well-known combinatorial meaning. In the present paper principal subpermanents per LK (G) and coefficients pk (G) of the permanental characteristic polynomial of L(G) are expressed by means of some collections of subgraphs of G.
openaire   +1 more source

Laplacian Growth and Random Matrix Theory

2014
The link between Laplacian growth and stochastic processes in the complex plane was discovered rather unexpectedly [581, 551], through their common relation to the multi-particle wavefunction description of the Quantum Hall Effect, in the single-Landau level approximation.
Björn Gustafsson, Razvan Teodorescu, Alexander Vasil’ev   +2 more
openaire   +1 more source

Hermitian normalized Laplacian matrix for directed networks

Information Sciences, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Guihai, Dehmer, Matthias, Emmert-Streib, Frank, Jodlbauer, Herbert   +3 more
openaire   +2 more sources

Sampled-Data Synchronization under Matrix-Weighted Laplacian

2019 Chinese Control Conference (CCC), 2019
In this paper, we study the synchronization problem of coupled identical electrical oscillators when the coupling between oscillators is described by matrices. In contrast to the mechanisms which make use of the instantaneous and the derivative information of the relative state, the sampled data technique is utilized to tackle the case when the ...
Shuang Li, Weiguo Xia
openaire   +1 more source

Normalized hodge laplacian matrix and its spectrum

2023
Let ? be a simplicial complex, ?[ Subscript ?] ∶ ?[ Subscript ?] → ?[ Subscript ?−1] a boundary map on ? and ?[ Subscript ?] a matrix representation of ?[ Subscript ?]. A Hodge ?-Laplacian matrix on simplicial complexes is defined by ?[ Subscript ?]
openaire   +1 more source