<p>Examples of -bidegreed graph families (a-f) and the size normalized sensitivity of their neutral fixation probabilities to , shown separately for each initial mutant location and evaluated at (g-j).</p>

A graph of size <i>N</i> sitting at a plotted point therefore has sensitivity equal to the plotted value divided by <i>N</i>. <b>a,</b> a star graph, . The <i>n</i>₂ = 1 center vertex has degree <i>d</i>₂ = 6 while the <i>n</i>₁ = 6 periphery vertices have degree <i>d</i>₁ = 1 for a total of vertices. <b>b,</b> a path graph, . The intermediate vertices have degree 2 while the endpoint vertices have degree 1. <b>c,</b> a bipartite biregular graph; the vertices on the left side have degree <i>d</i>₂ = 3 while the vertices on the right side have degree <i>d</i>₁ = 2, for a total of <i>N</i> = 10 vertices. <b>d,</b> a fan graph .

The center vertex has degree 2<i>b</i> = 6, while each of the 2 vertices on each of the <i>b</i> = 3 blades has degree 2, for a total of <i>N</i> = 2<i>b</i> + 1 = 7 vertices. <b>e,</b> a wheel graph . The center vertex has degree <i>n</i> = 8 while the <i>n</i> vertices on the spoke ends have degree 3, for a total of <i>N</i> = <i>n</i> + 1 = 9 vertices. <b>f,</b> a book graph . Each of the <i>p</i> = 3 pages has 2 page corners with degree 2, and the 2 seam endpoints have degree <i>p</i> + 1, for a total of <i>N</i> = 2<i>p</i> + 2 = 8 vertices. <b>g,</b> A contour plot in the space, where both parameters are dimensionless.

The lines with shapes denote the values of and for the various bidegreed graphs in <b>a-f</b>. Note that the path graph has <i>n</i>₁ = 2 and , so for . Thus as <i>N</i> increases, decreases.

The intensity of the colorbar denotes , <b>h,</b> , <b>i,</b> , and <b>j,</b> . Lighter colors indicate a larger sensitivity.</p>