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
A Novel Bayes Factor for Inverse Model Selection Problem based on Inverse Reference Distribution
Statistical model selection problem can be divided into two broad categories based on Forward and Inverse problem. Compared to a wealthy of literature available for Forward model selection, there are very few methods app...
Implicit Hybrid Block Six-Step Second Derivative Backward Differentiation Formula For The Solution Of Stiff Ordinary Differential Equations.
In this paper, we present a higher order of implicit hybrid block second derivative backward differentiation formula for the solution of stiff initial value problems in ordinary differential equation. The developed schem...
On Coincidence Points in Pseudocompact Tichonov Spaces and Common Fixed Points in Pseudocompact Topological Spaces
.
Birth and Death Processes_ General Case
ABirth and Death Processes(BDPs) is a continuous-time Markov chain that counts the number of particles in a system over time, they are popular modeling tools in population evolution, used more particularly in biology, ge...
Comparison Between Measures of Spatial Autocorrelation
This work is carried out with the view to analyze and compare Geary’s C and Moran’s I measures of spatial autocorrelation using the monthly rainfall statistics as the case study for the year 2014 as recorded in CBN Stati...