Showing 2026Show all
2 papers · 1 filter
math.CO2026
A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
Mauro Passacantando, Fabio Raciti
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We p…
cs.SI2026
Optimizing edge weights in the inverse eigenvector centrality problem
Mauro Passacantando, Fabio Raciti
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this i…