Results 21 to 30 of about 2,218,762 (336)
Interlacing Properties of Eigenvalues of Laplacian and Net-Laplacian Matrix of Signed Graphs
, 2023 This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex together with its incident edges.
Satyam Guragain, Ravi Srivastava
openalex +4 more sources
Permanent of the laplacian matrix of trees with a given matching
Discrete Mathematics, 1986 AbstractWe define the Laplacian ratio of a tree π(T), to be the permanent of the Laplacian matrix of T divided by the product of the degrees of the vertices. Best possible lower and upper bounds are obtained for π(T) in terms of the size of the largest matching in T.
John Goldwasser
openalex +3 more sources
A note on a conjecture for the distance Laplacian matrix
The Electronic Journal of Linear Algebra, 2016 In this note, the graphs of order n having the largest distance Laplacian eigenvalue of multiplicity n â2 are characterized. In particular, it is shown that if the largest eigenvalue of the distance Laplacian matrix of a connected graph G of order n has multiplicity n â 2, then G = S_n or G = K_(p,p), where n = 2p.
Celso M. da Silva +2 more
openaire +3 more sources
The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
Linear Algebra and its Applications, 2005 AbstractLet T be an unweighted rooted tree of k levels such that in each level the vertices have equal degree. Let dk−j+1 denotes the degree of the vertices in the level j. We find the eigenvalues of the adjacency matrix and of the Laplacian matrix of T. They are the eigenvalues of principal submatrices of two nonnegative symmetric tridiagonal matrices
Óscar Rojo, Ricardo L. Soto
openalex +5 more sources
Drug-Target Interaction Prediction via Dual Laplacian Graph Regularized Matrix Completion [PDF]
BioMed Research International, 2018 Drug-target interactions play an important role for biomedical drug discovery and development. However, it is expensive and time-consuming to accomplish this task by experimental determination.
Minhui Wang, Chang Tang, Jiajia Chen
openalex +2 more sources
A Quantum Algorithm for Solving Eigenproblem of the Laplacian Matrix of a Fully Connected Weighted Graph [PDF]
Advanced Quantum Technologies, 2022 Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix operations.
Hailing Liu +6 more
semanticscholar +1 more source
On Laplacian resolvent energy of graphs [PDF]
Transactions 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
Multi-View Spectral Clustering With High-Order Optimal Neighborhood Laplacian Matrix [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2020 Multi-view spectral clustering can effectively reveal the intrinsic clustering structure among data by performing clustering on the learned optimal embedding across views.
Weixuan Liang +7 more
semanticscholar +1 more source
Oversampled Graph Laplacian Matrix for Graph Filter Banks [PDF]
IEEE Transactions on Signal Processing, 2014 Akie Sakiyama, Yuichi Tanaka
openalex +2 more sources
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
AKCE 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