1 citations · 1 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
eess.SY2024
Designing Laplacian flows for opinion clustering in structurally balanced and unbalanced networks
Vishnudatta Thota, Twinkle Tripathy, Debasattam Pal
In this work, we consider a group of n agents whose interactions can be represented using unsigned or signed structurally balanced graphs or a special case of structurally unbalanc…
math.CO2024
Optimal k-centers of a graph: a control-theoretic approach
Karim Shahbaz, Madhu N. Belur, Chayan Bhawal +1
In a network consisting of n nodes, our goal is to identify the most central k nodes with respect to the proposed definitions of centrality. Depending on the specific application,…