2 papers
cs.SI2025
Recognizing Distance-Count Matrices is Difficult
Paolo Boldi, Flavio Furia, Chiara Prezioso +1
Axiomatization of centrality measures often involves proving that something cannot hold by providing a counterexample (i.e., a graph for which that specific centrality index fails…
math.CO2025
Branching Ratios of Input Trees for Directed Multigraphs
Paolo Boldi, Ian Stewart
We define the branching ratio of the input tree of a node in a finite directed multigraph, prove that it exists for every node, and show that it is equal to the largest eigenvalue…