NDLI: Target Set Selection Problem for Honeycomb Networks

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Yeh, Hong-Gwa Chiang, Chun-Ying Huang, Liang-Hao
Copyright Year	2013
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.
Starting Page	310
Ending Page	328
Page Count	19
File Format	PDF
ISSN	08954801
DOI	10.1137/120868864
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	1
Volume Number	27
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2013-02-12
Access Restriction	Subscribed
Subject Keyword	target set selection social networks Social networks Combinatorial optimization dynamic monopolies feedback vertex set viral marketing hexagonal grid honeycomb network decycling irreversible spread of influence strict majority threshold Reliability, testing and fault tolerance
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

Combinatorial model and bounds for target set selection (2010)

Dynamic selection of activation targets to boost the influence spread in social networks (2012).

Combinatorial Optimization Games Arise in Social Networks Team Members: (2014)

Dynamic selection of activation targets to boost the influence spread in social networks

An exact almost optimal algorithm for target set selection in social networks

On irreversible dynamic monopolies in general graphs ∗ (2009).

Some results on the target set selection problem

Brief Announcement: Active Information Spread in Networks

Target Set Selection Problem for Honeycomb Networks

Similar Documents

Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

Combinatorial model and bounds for target set selection (2010)

Dynamic selection of activation targets to boost the influence spread in social networks (2012).

Combinatorial Optimization Games Arise in Social Networks Team Members: (2014)

Dynamic selection of activation targets to boost the influence spread in social networks

An exact almost optimal algorithm for target set selection in social networks

On irreversible dynamic monopolies in general graphs ∗ (2009).

Some results on the target set selection problem

Brief Announcement: Active Information Spread in Networks

Target Set Selection Problem for Honeycomb Networks