The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...