Results 11 to 20 of about 121,348 (314)
Laplacian versus adjacency matrix in quantum walk search [PDF]
A quantum particle evolving by Schr dinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk.
Thomas G. Wong +2 more
openaire +4 more sources
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +4 more sources
LAPLACIAN MATRIX AND DISTANCE IN TREES
Laplacian matrix and distance in trees.
Damir Vukičević, İvan Gutman
openalex +3 more sources
Laplacian Matrix for Dimensionality Reduction and Clustering [PDF]
Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information. Graphs can in turn be represented by matrices. A special example is the Laplacian matrix, which allows us to assign each
Laurenz Wiskott, Fabian Schönfeld
openalex +4 more sources
LONMF: a non-negative matrix factorization model based on graph Laplacian and optimal transmission for paired single-cell multi-omics data integration. [PDF]
Nan M +6 more
europepmc +2 more sources
Graph Convolutional Network Using Adaptive Neighborhood Laplacian Matrix for Hyperspectral Images with Application to Rice Seed Image Classification. [PDF]
Orozco J +4 more
europepmc +3 more sources
Laplacian matrix of power 3 mean graphs [PDF]
S. Sarasree, S. S. Sandhya
openalex +2 more sources
On the Spectrum of Laplacian Matrix [PDF]
Let G be a simple graph of order n . The matrix ℒ
Akbar Jahanbani +2 more
openaire +2 more sources
The Laplacian matrix of weighted threshold graphs
Threshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes by a link of weight $w_i$.
Yingyue Ke +2 more
openalex +6 more sources
On Laplacian resolvent energy of graphs [PDF]
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

