Scinovex
article Open Access

Edge restrainedness in hypergraph

Abstract

In this paper we have introduced edge restrained set and one maximal edge restrained set in hypergraph. We have also introduced RE – Set and RE – Number in hypergraph. We have given characterization of one maximal edge restrained sets. We have also proved that in a hypergraph with minimum edge degree at least two every one – maximal edge restrained set is an edge h – dominating set. We have proved several results about edge restrainedness in subhypergraphs and partial subhypergraphs also.

graph theory and CDMA systemsAdvanced Graph Theory ResearchHypergraphEnhanced Data Rates for GSM EvolutionMathematicsCombinatoricsSet (abstract data type)Discrete mathematicsComputer scienceArtificial intelligence
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
24%
vs. same field & year
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.

Edge restrainedness in hypergraph · Scinovex