H-restrainedness, hypergraph, vertex, partial sub-hypergraph, H-dominating
1 article · search the full text for this term
-
H-Restrainedness for Hypergraphs
Abstract: I introduce a new concept for hypergraphs called H-restrainedness. I prove that an H-restrained set of a hypergraph does not contain a vertex of minimality if and only if the compliment of S is an Hdominating set. I also prove a necessary and sufficient condition under which the restrainedness number of a hypergraph decreases when a vertex is removed from the hypergraph. I have proven that Let G be a …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 8, Issue 3, 2021 · pp. 25–29 Read article