login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A354069
Number of vertices in the iterated clique graphs of the 1-skeleton of the snub disphenoid.
0
8, 12, 20, 56, 1076
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
Sequence in context: A175786 A258848 A072843 * A350615 A300065 A072902
KEYWORD
nonn,more
AUTHOR
STATUS
approved