论文信息 - A forest building process on simple graphs - 字舞流文

A forest building process on simple graphs

Paul Horn | Brent Moran | Jay Cummings | Ruth Luo | Steve Butler | Zhanar Berikkyzy | Kristin Heysse | S. Butler | Zhanar Berikkyzy | Jay Cummings | Kristin Heysse | Paul Horn | Ruth Luo | Brent Moran

[1] Béla Bollobás,et al. The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[2] Endre Szemerédi,et al. On the second eigenvalue of random regular graphs , 1989, STOC '89.

[3] Alan M. Frieze,et al. Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.

[4] Fan Chung,et al. Spectral Graph Theory , 1996 .

[5] Criel Merino,et al. Graph Polynomials and Their Applications I: The Tutte Polynomial , 2008, Structural Analysis of Complex Networks.

[6] Criel Merino,et al. Graph Polynomials and Their Applications II: Interrelations and Interpretations , 2008, Structural Analysis of Complex Networks.

[7] Fan Chung Graham,et al. Edge flipping in graphs , 2012, Adv. Appl. Math..

[8] Fan Chung Graham,et al. Edge flipping in the complete graph , 2015, Adv. Appl. Math..