login
A038193
Let G be an n-node graph with valencies d_1 .. d_n say; let m = (d_1 + ... + d_n)/n and s = n*Sum( (d_i-m)^2 ) be the scaled degree variance; a(n) gives number of different values taken by s.
1
1, 1, 2, 4, 11, 14, 43, 34, 102, 111, 296, 262
OFFSET
1,3
COMMENTS
Computed by Jan Hagberg, Dept. Statistics, Stockholm Univ., Sweden.
LINKS
J. Hagberg, Centrality testing and the distribution of the degree variance in Bernoulli graphs, Research Report 2000:8, Department of Statistics, Stockholm University, 2000.
Sean A. Irvine, Java program (github)
CROSSREFS
Sequence in context: A287210 A236524 A295968 * A227456 A214429 A002382
KEYWORD
nonn,nice,more
EXTENSIONS
Hagberg reference from C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 29 2004
a(10) corrected and a(11) added by Sean A. Irvine, Jan 10 2021
a(12) from Sean A. Irvine, Jan 13 2021
STATUS
approved