OFFSET
3,1
COMMENTS
The crown graph G(n) is the graph with vertex set {x(1), x(2), ...x(n), y(1), y(2), ..., y(n)} and edge set {(x(i), y(j)): 1<=i,j<=n, i != j} (= the complete bipartite graph K(n,n) with horizontal edges removed).
The value a(4)=240 has been checked by the direct computation of the distance matrix of the Mycielskian of G(4) (via Maple).
REFERENCES
D. B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ, 2001, p. 205.
LINKS
R. Balakrishnan, S. F. Raj, The Wiener number of powers of the Mycielskian, Discussiones Math. Graph Theory, 30, 2010, 489-498 (see Theorem 2.1).
B. E. Sagan, Y-N. Yeh and P. Zhang, The Wiener Polynomial of a Graph, Internat. J. of Quantum Chem., 60, 1996, 959-969.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
a(n) = 13*n^2 + 8*n.
G.f.: x^3*(141-183*x+68*x^2)/(1-x)^3.
MAPLE
a := proc (n) options operator, arrow: 13*n^2+8*n end proc: seq(a(n), n = 3 .. 40);
PROG
(PARI) a(n)=13*n^2+8*n \\ Charles R Greathouse IV, Jun 17 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Emeric Deutsch, Aug 29 2013
STATUS
approved