

A299030


Number of vertices in the iterated clique graphs of the 1skeleton of Plato's octahedron.


1




OFFSET

0,1


COMMENTS

The octahedron was the first known example of a kdivergent graph.


LINKS

Table of n, a(n) for n=0..3.
Miguel A. Pizaña, The icosahedron is clique divergent, Discrete Mathematics, 262 (Feb. 2003), pp. 229239.
YAGS, YAGS  Yet Another Graph System


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.


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

Cf. A299028, A063723, A053016.
Sequence in context: A270821 A139452 A245643 * A127400 A315941 A025081
Adjacent sequences: A299027 A299028 A299029 * A299031 A299032 A299033


KEYWORD

nonn,more


AUTHOR

José Hernández, Feb 01 2018


STATUS

approved



