Target Set Selection (TSS) was initially proposed to study the problem of the spread of information, ideas or influence through a social network and had formulated many problems arising in various practical applications. We consider a particular type of graphs, namely n-dimensional m-sided pancake graph mP_n, which is one class of Cayley graphs and is widely used in the symmetric interconnection networks. We establish a bound of TSS on mP_n by the minimum feedback vertex set.

中文翻译：

---

广义煎饼图上的目标集选择

最初提出了“目标集选择”（TSS），以研究通过社交网络传播信息，思想或影响的问题，并提出了各种实际应用中出现的许多问题。我们考虑一种特殊类型的图，即n维m侧煎饼图mP _n，它是一类Cayley图，并广泛用于对称互连网络中。我们通过最小反馈顶点集在mP _n上建立TSS的边界。