Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
We consider a generalization of Fiedler's notion of algebraic connectivity to directed graphs. We show that several properties of Fiedler's definition remain valid for directed graphs and present properties peculiar to directed graphs. We prove inequalities relating the algebraic connectivity to quantities such as the bisection width, maximum directed cut and the isoperimetric number. Finally, we illustrate an application to the synchronization in networks of coupled chaotic systems. © 2005 Taylor & Francis Group Ltd.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
T. Graham, A. Afzali, et al.
Microlithography 2000
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011