Results 1 to 10 of about 121,870 (266)

Laplacian versus Adjacency Matrix in Quantum Walk Search [PDF]

open access: yesQuantum Information Processing, 2016
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator.
Nahimov, Nikolay   +2 more
core   +5 more sources

The signless Laplacian matrix of hypergraphs

open access: yesSpecial Matrices, 2022
In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj   +3 more sources

Hermitian Laplacian Matrix of Directed Graphs [PDF]

open access: yesJisuanji kexue, 2023
Laplacian matrix plays an important role in the research of undirected graphs.From its spectrum,some structure and properties of a graph can be deduced.Based on this,several efficient algorithms have been designed for relevant tasks in graphs,such as ...
LIU Kaiwen, HUANG Zengfeng
doaj   +2 more sources

The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs

open access: yesTheory and Applications of Graphs, 2023
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

On the Spectrum of Laplacian Matrix [PDF]

open access: yesMathematical Problems in Engineering, 2021
Let G be a simple graph of order n . The matrix ℒ
Akbar Jahanbani   +2 more
openaire   +2 more sources

On Laplacian resolvent energy of graphs [PDF]

open access: yesTransactions 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

On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
In this article, we associate a Hermitian matrix to a multidigraph G. We call it the complex Laplacian matrix of G and denote it by [Formula: see text]. It is shown that the complex Laplacian matrix is a generalization of the Laplacian matrix of a graph.
Sasmita Barik   +2 more
doaj   +1 more source

Cospectral constructions for several graph matrices using cousin vertices

open access: yesSpecial Matrices, 2021
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj   +1 more source

Spektrum Laplace pada graf kincir angin berarah (Q_k^3)

open access: yesMajalah 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

The bipartite Laplacian matrix of a nonsingular tree

open access: yesSpecial Matrices, 2023
For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy