Target set selection problem for honeycomb networks

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/109287

Title:	Target set selection problem for honeycomb networks
Authors:	葉鴻國;Chiang, Chun-Ying;Huang, Liang-Hao;Yeh, Hong-Gwa
Contributors:	理學院數學系
Keywords:	Bombs;Byproducts;Councils;Customers;Functions (mathematics);Graphs;Honeycomb;Honeycomb construction;Investigations;Mathematical analysis;Monopolies;Networks;Optimization;Social networks;Thresholds;Viral marketing
Date:	2013-05-06
Issue Date:	2026-04-23 16:22:56 (UTC+8)
Publisher:	Society for Industrial and Applied Mathematics Publications;Philadelphia: Society for Industrial and Applied Mathematics
Abstract:	摘要： Let $G$ be a graph with a threshold function $\theta:V(G)\rightarrow \mathbb{N}$ such that $1\leq \theta(v)\leq d_G(v)$ for every vertex $v$ of $G$, where $d_G(v)$ is the degree of $v$ in $G$. Suppose we are given a target set $S\subseteq V(G)$. This paper considers the following repetitive process on $G$. At time step $0$ the vertices of $S$ are colored black and the other vertices are colored white. After that, at each time step $t>0$, the colors of white vertices (if any) are updated according to the following rule. All white vertices $v$ that have at least $\theta(v)$ black neighbors at the time step $t-1$ are colored black, and the colors of the other vertices do not change. The process runs until no more white vertices can update colors from white to black. The following optimization problem is called Target Set Selection: Find a target set $S$ of smallest possible size such that all vertices in $G$ are black at the end of the process. Such an $S$ is called an optimal target set for $G$ under the threshold function $\theta$. We are interested in finding an optimal target set for the well-known class of honeycomb networks under an important threshold function called a strict majority threshold, where $\theta(v)=\lceil (d_G(v)+1)/2\rceil$ for each vertex $v$ in $G$. In a graph $G$, a feedback vertex set is a subset $S\subseteq V(G)$ such that the subgraph induced by $V(G)\setminus S$ is cycle-free. In this paper we give exact value on the size of the optimal target set for various kinds of honeycomb networks under a strict majority threshold, and as a by-product we also provide a minimum feedback vertex set for different kinds of regular graphs in the class of honeycomb networks. [PUBLICATION ABSTRACT] 出版者： Philadelphia: Society for Industrial and Applied Mathematics 出版日期： 2013-01 出處： SIAM journal on discrete mathematics, 2013-01, Vol.27 (1), p.310-328 資源來源： SIAM Journals 版權： 2013, Society for Industrial and Applied Mathematics 識別號： ISSN: 0895-4801 識別號： EISSN: 1095-7146 識別號： DOI: 10.1137/120868864
Appears in Collections:	[Department of Mathematics] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	10	View/Open

社群 sharing

Loading...