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 87
- Downloads 0
Fixed Point Theorem in Fuzzy Metric Space with Implicit relation
This paper presents some common fixed point theorem for compatible type mapping in fuzzy metric space. Our result generalizes the result of I.Altun and D.Turkoglu [6].
Coupled Fixed Point Results in Partially Ordered Complete Metric Space
In this paper we prove some coupled fixed point results in partially ordered complete metric space.
Some New Families of Divisor Cordial Graphs
In this paper, the duplication of arbitrary vertex vk of cycle Cn (n ≥ 3),<Sn:Sn>, <Wn:Wn> , the graph obtained by joining two copies of cycle Wn by a path Pk (n ≥ 3), GvK1, where Gv denotes graph obtained by...
Pattern Generation for Two Dimensional Cutting Stock Problem
Selection of feasible cutting patterns in order to minimize the raw material wastage which is known as cutting stock problem has become a key factor of the success in today’s competitive manufacturing industries. I...
n_Multi-Series of the Generalized Difference Equations to Circular Functions
We investigate the numerical-complete relation to certain type of higher order generalized difference equation to find the value of n_multi-series to circular functions in the field of finite difference methods. We also...