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 108
- Downloads 0
On the exponential Diophantine equation
The exponential Diophantine equation in four variables given by is considered and analyzed for finding its non-zero integer solutions for different choices of m and n. A few numerical illustrations are present...
Improved Ujević method for finding zeros of linear and nonlinear equations
—In this paper, we suggest a new predictor- corrector method for solving nonlinear equations by combining Halley’s method and Ujević method. The method is verified on a number of test examples and numerical results...
MHD Effects on Composite Slider Bearing Lubricated with Couple-stress Fluids
A magneto-hydrodynamic wide composite slider bearing lubricated with couple-stress fluids is numerically analysed. A modified Reynolds equation has been derived to account for the transverse magnetic field in the couple-...
On the Dynamical Analysis of a New Model for Measles Infection
Epidemiologists and other health workers all over the world have noted that vaccination is an effective means of preventing most childhood diseases. In this study a compartmental mathematical model was formulated with th...
(ε,εvq)- Fuzzy ideals of d-algebra
Here we defined -fuzzy ideal of d-algebra and investigated some of its properties. AMS Subject Classification (2010): 06F35, 03G25, 08A72, 03B52.