We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
Milena Mihail, Christos H. Papadimitriou, Amin Sab...
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
Paul E. Gunnells, Richard A. Scott, Byron L. Walde...
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius