18 citations · 68 across the 27 of their papers we have counts for
1 paper · 1 filter
Igor Mezić, Vladimir A. Fonoberov, Maria Fonoberova +1
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts.…