Independent Domination of Splitted Graphs
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 8, Issue 1
Abstract
A dominating set D of a splitted graph S(G) = ( V, E ) is an independent dominating set if the induced subgraph <D> has no edges. The independent domination number i[S(G)] of a graph S(G) is the minimum cardinality of an independent dominating set.
Authors and Affiliations
A . Nellai Murugan , A . Esakkimuthu
Keywords
Related Articles
- EP ID EP110450
- DOI -
- Views 118
- Downloads 0
Stability Analysis of two Competitive Interacting Species with Optimal and Bionomic Harvesting of the Second Species
This paper deals with two species competitive model with optimal harvesting of the second species under bionomic conditions. The model is characterized by a pair of first order non-linear ordinary differential equa...
New Paranormed Sequence Spaces l∞(p,λ) , c(p,λ) and c0(p,λ) Generated by an Infinite Matrix
In this paper we introduce a set of new paranormed sequence spaces , and which are generated by an infinite lower uni triangular matrix where is an infinite matrix given by, as defined in [6] . We also compute the basis...
On Some Generalized Well Known Results of Fixed Point Theorems of T- Contraction Mappings in Cone Metric Spaces
In this paper, we obtain sufficient conditions for the existence of a common fixed point of T- Contraction mapping in the setting on complete cone metric spaces. Our results generalized well known recent result of Garg a...
Location of Regions Containing No Zero of a Polynomial
In this paper we locate regions containing no zero of a polynomial whose coefficients are restricted to certain conditions
On (M,Q,G*)-Open Functions in M-Structures
The purpose of this paper is to give a new type of open function and closed function called (M,Q,G*)-open function and (M,Q,G*)-closed function. Also, we obtain its characterizations and its basic properties