12 citations · 12 across the 2 of their papers we have counts for
2 papers
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,…
math.CO2021★ 12 cited
Algebraic connectivity: local and global maximizer graphs
Karim Shahbaz, Madhu N. Belur, Ajay Ganesh
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic conne…