Distance r-Coloring and Distance r-Dominator Coloring number of a graph
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 5, Issue 3
Abstract
Given a positive integer r, two vertices u,v V(G) are r-independent if d(u,v) > r. A partition of V(G) jnto r-independent set is called distance r-coloring . A study of distance r-coloring and distance r-dominator coloring concepts are studied in this paper.
Authors and Affiliations
G. Jothilakshmi , A. P. Pushpalatha , G. Sudhalakshmi , S. Suganthi , v. Swaminathan
Single Term Haar Wavelet Series for Fuzzy Differential Equations
In this paper numerical method for solving fuzzy ordinary differential equations using Single Term Haar Wavelet Series (STHWS) method[9-15] is considered. The obtained discrete solutions using STHWS are compared with the...
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...
A Regression Model to Investigate the Performance of Black-Scholes using Macroeconomic Predictors
As it is well known an option is defined as the right to buy sell a certain asset, thus, one can look at the purchase of an option as a bet on the financial instrument under consideration. Now while the evaluation of opt...
Magic and Bimagic Labeling for Disconnected Graphs
An edge magic total labeling of a graph G V E ( , ) with p vertices and q edges is a bijection f from the set of vertices and edges to 1,2,..., p q such that for every edge uv in E, f u f uv f v ( ) ( ) ( ) ...
Common Fixed Point Theorems in Quasi-Gauge Space for Six Self Maps
The aim of this paper is to prove, mainly, a common fixed point theorem for six self mappings and its consequences under the condition of weakly compatible mappings in a Quasi-Gauge space.