Target set selection in plane graphs

Read full text Summarise with VIRAT
Authors: Haining Jiang, Haiyun Wan
Cited by: 0
References: 23

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The target set selection (TSS) problem was initially proposed to study the spread of information, ideas, or influence in social networks. It has been used to model many problems arising in various practical applications. In this paper, we study the TSS problem for plane graphs. We provide a characterization of plane graphs $ G $ for which $ \min_3(G) = 3 $. Consequently, we show that the minimum degree of such plane graphs is at most 4.

Fields of Study & Subjects

Advanced Graph Theory Research Complex Network Analysis Techniques Complexity and Algorithms in Graphs

Publication details

Journal / source
AIMS Mathematics
Volume
11
Issue
3
Pages
7934–7944
Publication date
1 January 2026
Language
EN