login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299030 Number of vertices in the iterated clique graphs of the 1-skeleton of Plato's octahedron. 1
6, 8, 16, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

The octahedron was the first known example of a k-divergent 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. 229-239.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 08:31 EDT 2021. Contains 345018 sequences. (Running on oeis4.)