AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (539.4 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Target set selection in plane graphs

Haining Jiang1( ), Haiyun Wan2
School of Mathematics and Statistics, Heze University, Heze 274015, China
Department of Public Education, Heze Medical College, Heze 274015, China
Show Author Information

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.

Keywords

target set selectionplane graph
CLC number: 05C10, 05C82

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 11 Issue 3,
March 2026
Pages 7934-7944
DOI: 10.3934/math.2026327

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Jiang H, Wan H. Target set selection in plane graphs. AIMS Mathematics, 2026, 11(3): 7934-7944. https://doi.org/10.3934/math.2026327

7

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus
Received: 03 December 2025
Revised: 02 March 2026
Accepted: 23 March 2026
Published: 15 March 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)