Partial domination of hypergraphs

DOI10.1007/S00373-024-02840-2MaRDI QIDQ6632148zbMATH OpenFDO

Authors Minhui Li, Shumin Zhang, Chengfu Ye

Publication date 4 November 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-024-02840-2

zbMATH Keywords

\(\mathcal{F}\)-isolating set\(\mathcal{F}\)-isolation numberhypergraph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Isolation in graphs
• \(k\)-isolation in graphs
• Hypergraphs with large domination number and with edge sizes at least three
• Interrelations among the notions of independence, domination and full sets in a hypergraph
• \( P_5\)-isolation in graphs

Cites work

• Domination in hypergraphs
• Domination in intersecting hypergraphs
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Hypergraph domination and strong independence
• Hypergraph theory. An introduction
• Isolation number of maximal outerplanar graphs
• Isolation of \(k\)-cliques
• Isolation of cycles
• Partial domination -- the isolation number of a graph
• Transversals and domination in uniform hypergraphs

Cited in

(1)

• A characterization of graphs with maximum k-clique isolation number

This page was built for publication: Partial domination of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632148)