Edge Domination in Hypergraph
Journal Title: International Journal of Mathematics and Statistics Invention - Year 2017, Vol 5, Issue 9
Abstract
In this paper we define the concept of edge domination in hypergraphs. We characterize minimal edge dominating sets in hypergraphs. We also prove that a set of vertices S of a hypergraph is a dominating set iff S* is an edge dominating set in the dual hypergraph. We also prove a necessary and sufficient condition under which the edge domination number of a hypergraph increases when a vertex is removed from the hypergraph. We also give some examples of edge dominating set.
Authors and Affiliations
D. K. Thakkar, V. R. Dave
Keywords
Related Articles
- EP ID EP406696
- DOI -
- Views 130
- Downloads 0
An Affiliation of DHEA Furthermore, DHEAs with Undesirable Distress Between Smokers Through Furthermore, Deprived of PTSD
Posttraumatic stress Disorder(PTSD) is related with expanded smoking initiation, upkeep Furthermore, relapse. Dehydroepiandrosterone (DHEA) Furthermore, DHEA sulfate (DHEAS) are neurosteroids that have been related with...
An Analysis of Stock Market Prediction Based On Stochastic Approach
.
Numerical Optimization of Fractional Order PID Controller
The fractional order PID controller is the generalization of classical PID controller, many Researchers interest in tuning FOPID controller here we use the Pareto Optimum technique to estimate the controller parameter an...
The Total Strong Split Domination Number of Graphs
A total dominating set D of graph G = (V, E) is a total strong split dominating set if the induced subgraph < V-D > is totally disconnected with atleast two vertices. The total strong split domination number γtss(G) is t...
Poisson-Mishra Distribution
A one parameter Poisson-Mishra distribution has been obtained by compounding Poisson distribution with Mishra distribution of B.K.Sah(2015). The first four moments about origin have been obtained. The maximum likelihood...