Results 61 to 70 of about 13,640 (282)
MathematicsFor network graphs, numerous graph features are intimately linked to eigenvalues of the Laplacian matrix, such as connectivity and diameter. Thus, it is very important to solve eigenvalues of the Laplacian matrix for graphs.
Changlei Zhan, Xiangyu Li, Jie Chen
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph .
Qingyun Tao, Yaoping Hou
doaj +1 more source
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
The Laplacian eigenvalues and invariants of graphs [PDF]
Filomat, 2014 In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence of Hamiltonicity in a graph involving its Laplacian eigenvalues.
Pan, Rong-Ying +2 more
openaire +2 more sources
Composition‐Aware Cross‐Sectional Integration for Spatial Transcriptomics
Advanced Intelligent Discovery, EarlyView.Multi‐section spatial transcriptomics demands coherent cell‐type deconvolution, domain detection, and batch correction, yet existing pipelines treat these tasks separately. FUSION unifies them within a composition‐aware latent framework, modeling reads as cell‐type–specific topics and clustering in embedding space.
Qishi Dong +5 more
wiley +1 more source
Interconnection topologies for multi-agent coordination under leader–follower framework
, 2009 In this paper, the formation control problem of the network of multiple agents is studied in terms of controllability, where the network is of the leader–follower structure with some agents taking leaders role and others being followers interconnected ...
Wang, Z +5 more
core +1 more source
Laplacian Coefficients of a Forest in Terms of the Number of Closed Walks in the Forest and its Line Graph [PDF]
Mathematics Interdisciplinary ResearchIn this paper, we deal with calculating the laplacian coefficients of a finite simple graph $G$ with the Laplacian polynomial $\psi(G,\lambda) = \sum_{k=0}^{n}(-1)^{n-k}c_k\lambda^k$.
Ali Ghalavand, Alireza Ashrafi
doaj +1 more source
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
Normalized Laplacians for gain graphs
American Journal of Combinatorics, 2022 We propose the notion of normalized Laplacian matrix \(\mathcal{L}(\Phi)\) for a gain graph \(\Phi\) and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of \(\mathcal{L}(\Phi)\) and characterize the classes of graphs for which equality holds.
M. Rajesh Kannan +2 more
openaire +4 more sources