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…