Transactions on Combinatorics (Mar 2019)

On the zero forcing number of generalized Sierpinski graphs

  • Ebrahim Vatandoost,
  • Fatemeh Ramezani,
  • Saeid Alikhani

DOI
https://doi.org/10.22108/toc.2018.101107.1463
Journal volume & issue
Vol. 8, no. 1
pp. 41 – 50

Abstract

Read online

In this article we study the Zero forcing number of Generalized Sierpi\'{n}ski graphs $S(G,t)$‎. ‎More precisely‎, ‎we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight‎. ‎In particular‎, ‎we consider the cases in which the base graph $G$ is a star‎, ‎path‎, ‎a cycle or a complete graph‎.

Keywords