Algebraic connectivity on a subclass of caterpillars. - Oscar Rojo; Israel Rocha; Vilmar Trevisan (Electron. Notes Discret. Math., 2011)

Bounding the sum of the largest Laplacian eigenvalues of graphs. - Israel Rocha; Vilmar Trevisan (Discret. Appl. Math., 2014)

Absolute algebraic connectivity of double brooms and trees. - Sebastian Richter; Israel Rocha (Discret. Appl. Math., 2016)

Spectral Bisection with Two Eigenvectors. - Israel Rocha (Electron. Notes Discret. Math., 2017)

Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs. - Christoph Helmberg; Israel Rocha; Uwe Schwerdtfeger (SIAM J. Discret. Math., 2017)

A Generalization of Erdős' Matching Conjecture. - Christos Pelekis; Israel Rocha (Electron. J. Comb., 2018)

Independent sets, cliques, and colorings in graphons. - Jan Hladký; Israel Rocha (Eur. J. Comb., 2020)

Relating the cut distance and the weak* topology for graphons. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory B, 2021)

Fractional Isomorphism of Graphons. - Jan Grebík; Israel Rocha (Comb., 2022)

Cut distance identifying graphon parameters over weak* limits. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory A, 2022)