Results 191 to 200 of about 13,572 (222)

Enhancing energy predictions in multi-atom systems with multiscale topological learning.

J Mater Chem A Mater
Chen D, Wang R, Wei GW, Pan F.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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.
Nenad Trinajstić, Zlatko Mihalić, Darko Babić, Dragan Amić, Sonja Nikolić, Dejan Plavsic   +5 more
openaire   +3 more sources

The perturbed laplacian matrix of a graph

Linear and Multilinear Algebra, 2001
For a graph G, we define its perturbed Laplacian matrix as D−A(G) where A(G) is the adjacency matrix of G and D is an arbitrary diagonal matrix. Both the Laplacian matrix and the negative of the adjacency matrix are special instances of the perturbed Laplacian.
Steve Kirkland, Ravindra B. Bapat, S. Pati   +2 more
openaire   +2 more sources

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   +2 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   +2 more sources

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   +2 more sources

On the eigenvalues of Laplacian ABC -matrix of graphs

Quaestiones Mathematicae, 2023
No ...
Bilal Ahmad Rather, Hilal A. Ganie, Xueliang Li   +2 more
openaire   +2 more sources

Duality and the signed Laplacian matrix of a graph

Linear Algebra and its Applications, 2018
Abstract We give a necessary and sufficient condition for a bijection between the edge sets of two graphs to be a dual bijection. The condition involves unimodular congruence of augmented signed Laplacian matrices for the two graphs.
Lorenzo Traldi, William Watkins, Derek A. Smith   +2 more
openaire   +2 more sources

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   +2 more sources