most citedThe Equivalence of Two Graph Polynomials and a Symmetric Function

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2008★ 1 cited

The Equivalence of Two Graph Polynomials and a Symmetric Function

Criel Merino, Steven D. Noble

The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of…

math.CO2008

The Clustering Coefficient of a Scale-Free Random Graph

Nicole Eggemann, Steven D. Noble

We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly…