- document
-
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies...journal article 2019
- document
-
Wang, X. (author), Dubbeldam, J.L.A. (author), Van Mieghem, P.F.A. (author)Kemeny's constant and its relation to the effective graph resistance has been established for regular graphs by Palacios et al. [1]. Based on the Moore–Penrose pseudo-inverse of the Laplacian matrix, we derive a new closed-form formula and deduce upper and lower bounds for the Kemeny constant. Furthermore, we generalize the relation between...journal article 2017