2 publications

• Published Subscription 19 Apr 2022

  Vertex Covered Hypergraphs

  By Kirit N. Kalariya

  Abstract: In this Paper I consider a minimal vertex covering sets and minimal strong vertex covering sets. I define Hypergraph, Sub-hypergraph, Partial sub-hypergraph, Vertex covering set, Minimal Vertex covering set, upper vertex covering set and upper vertex covering number in this paper and I consider the effect of removing a vertex on the upper vertex covering number of the hypergraph. Then I prove that the upper vertex covering number does not …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 1, 2022 · pp. 1–5 Read article →

• Published Subscription 4 Apr 2022

  H-Restrainedness for Hypergraphs

  By Kirit N. Kalariya

  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 →