OFFSET
0,1
COMMENTS
The octahedron was the first known example of a k-divergent graph.
LINKS
Miguel A. Pizaña, The icosahedron is clique divergent, Discrete Mathematics, 262 (Feb. 2003), pp. 229-239.
FORMULA
a(n) = sqrt(2)^sqrt(2)^...^sqrt(2)^6 with n occurrences of sqrt(2). - Omar Antolín-Camarena, May 16 2022
EXAMPLE
By definition, the zeroth iterated clique graph of a graph G is equal to G itself; since the octahedron has 6 vertices, a(0)=6.
The first iterated clique graph of the octahedron has 8 vertices; hence, a(1)=8.
MATHEMATICA
Nest[Sqrt[2]^#&, 6, n] (* Omar Antolín-Camarena, May 16 2022 *)
PROG
(YAGS) K:=CliqueGraph;; g:=Octahedron;; kg:=K(g);; Order(kg);
# It outputs the number of vertices in the first iterated
# clique graph of the octahedron.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
José Hernández, Feb 01 2018
EXTENSIONS
a(4) from Omar Antolín-Camarena, May 16 2022
STATUS
approved