OFFSET
0,1
COMMENTS
It is unknown if this sequence is unbounded (the sequence of orders of the iterated clique graphs of a graph is either unbounded or eventually periodic).
LINKS
Francisco Larrión, Victor Neumann‐Lara, and Miguel A. Pizaña, Graph relations, clique divergence and surface triangulations, preprint of Journal of Graph Theory 51.2 (2006): 110-122.
PROG
(GAP with YAGS) a := function (n) local G, i; G:=SnubDisphenoid; for i in [1..n] do G:=CliqueGraph(G); od; return Order(G); end;;
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Omar Antolín-Camarena, May 16 2022
STATUS
approved