OFFSET
4,3
REFERENCES
Claude C.S. and Dinneen M.J (1998), Group-theoretic methods for designing networks, Discrete mathematics and theoretical computer science, Research report
Comellas, F. and Gomez, J. (1995), New large graphs with given degree and diameter, in Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Volume 1: pp. 222-233
Ibrahim, A., A. (2007), A stable variety of Cayley graphs (in preparation)
LINKS
Eric Weisstein's World of Mathematics, Graph Thickness
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 1, -1).
FORMULA
f(D4,5)=1: Order =4,5; f(D)= f(D4,5)+n: order=5+n, n=1,2,...
I am assuming this sequence is just Floor[(n+5)/4]... [From Eric W. Weisstein, Sep 09 2008]
EXAMPLE
f(D4,5)=1 when order=4, f(D4,5)=1 when order=5, f(D)=f(D4,5)+1=1+1=2 when order is 5+1=6
CROSSREFS
KEYWORD
nonn
AUTHOR
Aminu Alhaji Ibrahim, Apr 25 2007
STATUS
approved