@article{Jiang2026, 
author = {Haining Jiang and Haiyun Wan},
title = {Target set selection in plane graphs},
year = {2026},
journal = {AIMS Mathematics},
volume = {11},
number = {3},
pages = {7934-7944},
keywords = {target set selection, plane graph},
url = {https://www.sciopen.com/article/10.3934/math.2026327},
doi = {10.3934/math.2026327},
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.}
}