The 2-admissible property of graphs in terms of radius
Filomat · 2025 · 39 (23) · 8097-8102
DOI: 10.2298/fil2523097h ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Hongbo Hua und 1 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
Let G be a graph and N_G^2[D] be the 2-closed neighborhood of a vertex subset D in G . For a property P of a graph G , a vertex subset D is said to be a P -2-admissible set of G if G - N_G^2[D] admits the property P . The P -2-admission number of G , denoted by \eta(G, P, 2) , is the cardinality of a minimum P -2-admissible set in G . For a positive integer k , we say a graph G has the property R_k if each component of G has radius at most k . Then the R_1 -2-admission number of a graph G , denoted by \eta(G, R_1, 2) , is the cardinality of a minimum vertex subset D such that V(G) = N_G^2[D] or each component of G - N_G^2[D] is a graph having radius at most one. In this paper, we prove that if G is a connected graph of order n such that G \notin \{P_4, C_4, C_9\} , then \eta(G, R_1, 2) \le n/5 , and that the bound is sharp.
Zitieren
APA
Hua, H., & Liu, H. (2025). The 2-admissible property of graphs in terms of radius. Filomat, 39(23), 8097-8102. https://doi.org/10.2298/fil2523097h
Vancouver
Hua H, Liu H. The 2-admissible property of graphs in terms of radius. Filomat. 2025;39(23):8097-8102. doi:10.2298/fil2523097h
BibTeX
@article{Hua2025,
author = {Hua, Hongbo and Liu, Hechao},
title = {The 2-admissible property of graphs in terms of radius},
journal = {Filomat},
year = {2025},
volume = {39},
number = {23},
pages = {8097--8102},
doi = {10.2298/fil2523097h}
}
EUVIMED