## Sara Zemljic (28/11/16)

Anders Claesson, nóvember 23, 2016

Málstofa í stærðfræði

### Titill: Generalized Sierpiński graphs

Staðsetning: V-158, VRII
Tími: Mánudaginn 28. nóvember kl. 15:00

### Ágrip:

(Generic) Sierpiński graphs are two parametric family of graphs, one parameter tells us what complete graph is the main building block for the graph, and the other parameter tells us in which iteration we are. A generalization of these graphs was proposed such that instead of taking a complete graph we start with an arbitrary graph G as our base graph and build the graph $$S_G^n$$ in the same iterative manner as generic Sierpiński graphs. We will examine many basic graph properties and standard graph invariants for generalized Sierpiński graphs.