Results 271 to 280 of about 121,348 (314)

Rolling Bearing Fault Diagnosis Based on Multi-Source Domain Joint Structure Preservation Transfer with Autoencoder. [PDF]

Sensors (Basel)
Jiang Q, Shi T, Hou X, Miao B, Zhang Z, Jin Y, Wang Z, Zhou H.   +7 more
europepmc   +1 more source

Novel Laplacian Matrix-based Molecular Descriptors Derived by Graph Convolution: Development and Applications in QSAR Studies

Igor Kuzmanovski, Subhash C. Basak
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Matrix-Tree Theorem of digraphs via signless Laplacians

Linear Algebra and its Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu Li, Lu Lu, Jianfeng Wang, Weifang Wang   +3 more
openaire   +2 more sources

The Laplacian matrix in chemistry

Journal of Chemical Information and Computer Sciences, 1994
The Laplacian matrix, its spectrum, and its polynomial are discussed. An algorithm for computing the number of spanning trees of a polycyclic graph, based on the corresponding Laplacian spectrum, is outlined. Also, a technique using the Le Verrier-Faddeev-Frame method for computing the Laplacian polynomial of a graph is detailed.
Trinajstić, Nenad, Babić, Darko, Nikolić, Sonja, Plavšić, Dean, Amić, Dragan, Mihalić, Zlatko   +5 more
openaire   +3 more sources

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