Year: 2024
Type: article
Abstract: For any graph G, a subset D ⊆ V (G) is called a P3-isolating set of G if G − N[D] contains no P3 as a subgraph, that is, consists of isolated vertices and isolated edges only. The P3-isolation number of G, denoted by ι(G, P3), is the cardinality of a smallest P3-isolating set of G. Zhang and Wu [Discrete Appl. Math. 304 (2021) 365–374] investigated the parameter ι(G, P3) of a graph, and they proved that if G ∉ {P3, C3, C6} is a connected graph of order n, then ι(G,P3)≤27n. In this paper, we shall prove that if G ∉ {P3, C7, C11} is a connected graph of order n without triangles and induced 6-cycles, then ι(G,P3)≤n4, and the upper bound is sharp. This extends a result on ι(T, P3) of a tree T by Caro and Hansberg [Filomat 31 (2017) 3925–3944].
Source: RAIRO - Operations Research
DOI: 10.1051/ro/2024178
Authors: Xiaohua Wei, Gang Zhang, Biao Zhao
Institutions: Xinjiang University, Xiamen University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4402473199