The following pages link to Israel Rocha (Q908314):
Displayed 22 items.
- Absolute algebraic connectivity of double brooms and trees (Q908315) (← links)
- Spectral bisection with two eigenvectors (Q1690049) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- Recovering the structure of random linear graphs (Q1790469) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Cut distance identifying graphon parameters over weak* limits (Q2120830) (← links)
- Brouwer's conjecture holds asymptotically almost surely (Q2174101) (← links)
- Independent sets, cliques, and colorings in graphons (Q2189827) (← links)
- Partial sum of eigenvalues of random graphs. (Q2216223) (← links)
- Relating the cut distance and the weak* topology for graphons (Q2222051) (← links)
- On the sum of the Laplacian eigenvalues of a tree (Q2431198) (← links)
- Characterizing trees with large Laplacian energy (Q2437344) (← links)
- Bounding the sum of the largest Laplacian eigenvalues of graphs (Q2449092) (← links)
- A Fiedler-like theory for the perturbed Laplacian (Q2828811) (← links)
- Algebraic connectivity on a subclass of caterpillars (Q2840700) (← links)
- Algebraic connectivity of k-connected graphs (Q5249658) (← links)
- Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs (Q5268000) (← links)
- Characterizing the second smallest eigenvalue of the normalized Laplacian of a tree (Q6242572) (← links)
- Eternal Picaria (Q6275572) (← links)
- Cut distance identifying graphon parameters over weak* limits (Q6306550) (← links)
- Fractional Isomorphism of Graphons (Q6324966) (← links)