3 papers
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…
math.OC2026
Least cores in energy community games
Giancarlo Bigi, Davide Fioriti, Antonio Frangioni +2
An energy community is modeled as a cooperative game, where a veto player is needed beyond the prosumers to manage the community, and the worth of a coalition is its benefit compar…
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…