Results 81 to 90 of about 11,443 (267)
Advanced Intelligent Systems, EarlyView.This paper proposes a novel control framework to ensure safety of a robotic swarm. A feedback optimization controller is capable of driving the swarm toward a target density while keeping risk‐zone exposure below a safety threshold. Theory and experiments show how safety is more effectively achieved for sparsely connected swarms.
Longchen Niu, Gennaro Notomista
wiley +1 more source
Total π-electron energy and Laplacian energy: How far the analogy goes? [PDF]
Journal of the Serbian Chemical Society, 2007 The Laplacian energy LE is a newly introduced molecular-graph-based analog of the total π-electron energy E. It is shown that LE and E have a similar structure-dependency only when molecules of different sizes are compared, when a good linear correlation
Radenković Slavko, Gutman Ivan
doaj +1 more source
Advanced Intelligent Systems, EarlyView.Four decades of retinal vessel segmentation research (1982–2025) are synthesized, spanning classical image processing, machine learning, and deep learning paradigms. A meta‐analysis of 428 studies establishes a unified taxonomy and highlights performance trends, generalization capabilities, and clinical relevance.
Avinash Bansal +6 more
wiley +1 more source
Laplacian energies of vertices
Linear Algebra and its ApplicationsIn this work, we define the Laplacian and Normalized Laplacian energies of vertices in a graph, we derive some of its properties and relate them to combinatorial, spectral and geometric quantities of the graph.
openaire +3 more sources
, 2018 The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance
Abdollah Alhevaz +2 more
core +1 more source
The Laplacian spread of graphs [PDF]
, 2009 summary:The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread,
Tan, Ying-Ying +4 more
core +1 more source
IEEE Access, 2019 Multi-modality image fusion provides more comprehensive and sophisticated information in modern medical diagnosis, remote sensing, video surveillance, and so on.
Zhiqin Zhu +4 more
doaj +1 more source
The Laplacian-energy like invariant is an energy like invariant [PDF]
, 2010 Short time ago Liu and Liu [MATCH Commun. Math. Comput. Chem. 59 (2008) 355–372] put forward a so-called Laplacian–energy like invariant (LEL), defined as the sum of the square roots of the Laplacian eigenvalues.
Zhou, Bo, Furtula, Boris, Gutman, Ivan
core
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +1 more source
New skew Laplacian energy of simple digraphs [PDF]
Transactions on Combinatorics, 2013 For a simple digraph $G$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $G$, respectively.
Qingqiong Cai, Xueliang Li, Jiangli Song
doaj