Results 81 to 90 of about 13,640 (282)
Spectra of Graphs Resulting from Various Graph Operations and Products: a Survey
Special Matrices, 2018 Let G be a graph on n vertices and A(G), L(G), and |L|(G) be the adjacency matrix, Laplacian matrix and signless Laplacian matrix of G, respectively. The paper is essentially a survey of known results about the spectra of the adjacency, Laplacian and ...
Barik S., Kalita D., Pati S., Sahoo G.
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
Trends in Computational and Applied Mathematics, 2021 We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Advanced Intelligent Systems, EarlyView.Single‐cell Spatial Transcriptomics Analysis and Denoising Engine is introduced as a unified deep learning framework that jointly performs denoising, clustering, and gene prioritization in spatial transcriptomics. By integrating linear and nonlinear representations within a dual‐channel architecture, it improves robustness and accuracy, uncovers ...
Yaxuan Cui +11 more
wiley +1 more source
Color signless Laplacian energy of graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj +1 more source
On graphs with the largest Laplacian index [PDF]
, 2008 summary:Let $G$ be a connected simple graph on $n$ vertices. The Laplacian index of $G$, namely, the greatest Laplacian eigenvalue of $G$, is well known to be bounded above by $n$.
Chen, Zhibo, Liu, BoLian, Liu, Muhuo
core
A NOTE ON THE LEAST (NORMALIZED) LAPLACIAN EIGHVA;UE OF SIGNED GRAPHS
, 2017 Let Γ=(G,σ)Γ=(G,σ) be a connected signed graph, and L(Γ)L(Γ) be its Laplacian and L(Γ)L(Γ) its normalized Laplacian with eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn and μ1≥μ2≥⋯≥μnμ1≥μ2≥⋯≥μn, respectively.
Li, Hui Shu;Li, Hong Hai
core +1 more source
Laplacian Controllability of Interconnected Graphs [PDF]
IEEE Transactions on Control of Network Systems, 2020 In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two connected simple graphs called the structure graph and the cell graph.
openaire +2 more sources
A Local Structural Descriptor for Image Matching via Normalized Graph Laplacian Embedding
, 2016 This paper investigates graph spectral approaches to the problem of point pattern matching. Specifically, we concentrate on the issue of how to effectively use graph spectral properties to characterize point patterns in the presence of positional jitter ...
Lu, Ke +4 more
core +1 more source
Noisy random graphs and their Laplacians
Discrete Mathematics, 2008 This paper deals with the spectra of weighted graphs. Define a Wigner-noise matrix to be an \(n\times n\) matrix \(W\) whose entries \(w_{ij}\) are uniformly bounded random variables with expectations zero and variances bounded by some \({\sigma^2}\), informally, a small noisy perturbation matrix. The eigenvalues of such \(W\) are known to be \` small\'
openaire +2 more sources
Graph Laplacians and their convergence on random neighborhood graphs
CoRR, 2006 Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in several machine learning methods like semi-supervised learning, dimensionality reduction and clustering.
Hein, M., Audibert, J., von Luxburg, U.
openaire +4 more sources