A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
Abstract
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 provide a complete characterization in terms of stable sets and their neighborhoods, showing that the undirected case requires nontrivial global constraints absent in the directed setting.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.