Fact Type Results in Half Domination in Graphs
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 8, Issue 1
Abstract
Let G = (V, E) be a finite graph with n vertices and m edges. A subset D⊆ V of vertices in a graph G is called half dominating set if at least half of the vertices of V(G) are either in D or adjacent to vertices of D. (i.e) |N[D]| ≥ ⌈|V(G)/2|⌉ . In this paper we deals with fact type results in half domination number of G.
Authors and Affiliations
S. Balamurugan , P . Sixthus Renita
Keywords
Related Articles
- EP ID EP157716
- DOI -
- Views 92
- Downloads 0
The Upper Connected Monophonic Number and Forcing Connected Monophonic Number of a Graph
— A connected monophonic set ࡹ in a connected graph ࡳ = (ࢂ,ࡱ) is called a minimal connected monophonic set if no proper subset of M is a connected monophonic set of ࡳ. The upper connected monophonic number mc ...
Mathematical Technique Based Speaker Recognition for Total Security System
Today security system is rapidly growing and updating simultaneously due to advance of technology. This growth in electronic transactions results in a rise of demand for fast and accurate user identification and authenti...
Fuzzy Transportation Problem Using Improved Fuzzy Russells Method
In this paper, we investigate the new idea of optimal solution of squared triangular and trapezoidal fuzzy number via fuzzy russal’s method. This method is a modification of yager’s ranking method. A new algorithm is inv...
On Semi-Symmetric Metric Connection in a Generalized (k,μ) Space Forms
In this paper we study some properties of curvature tensor on semi-symmetric metric connection in a generalized space forms. As a consequence of these results we investigate the conditions for a generalized space forms t...
RELATIONAL ALGEBRA IN SQL
Relational Algebra is that branch of algebra which deals about set operations on a given relation such as UNION,INTERSECTION,DIFFERENCE,CARTESIAN PRODUCT, PROJECTION ,SELECTION. In this paper we shall discuss these...