Back to Search Start Over

Partial Domination of Hypergraphs.

Authors :
Li, Minhui
Zhang, Shumin
Ye, Chengfu
Source :
Graphs & Combinatorics. Dec2024, Vol. 40 Issue 6, p1-10. 10p.
Publication Year :
2024

Abstract

Let H = (V , E) be a hypergraph. A subset S ⊆ V is called F -isolating of H if the induced subhypergraph H [ V \ N [ S ] ] contains no any member in F as a subhypergraph. The F -isolation number of H is the minimum cardinality of an F -isolating set of H, denoted by ι (H , F) . A subset S ⊆ V is an isolating set of H if V \ N [ S ] is an independent set of H. The cardinality of a minimum isolating set of H is called the isolation number of H, denoted by ι (H) . In this paper, we introduce the F -isolating set of hypergraphs and give some results about the F -isolation number of hypergraphs. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09110119
Volume :
40
Issue :
6
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
180242922
Full Text :
https://doi.org/10.1007/s00373-024-02840-2