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
Keywords
Related Articles
- EP ID EP126456
- DOI -
- Views 94
- Downloads 0
Some Results on Intuitionistic Fuzzy Soft Sets
The purpose of this paper is to study some basic operations and results available in the literature of intuitionistic fuzzy soft sets. Some new results along with illustrating examples have been put forward in our...
(ε,ε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.
Inextensible flows of curves in the equiform geometry of the simple isotropic space J[sub][/sub][sub]3[/sub][sup]( I )[/sup]
In this paper, evolution equations for inextensible flows of curves in the simple isotropic space are investigated and necessary and sufficient conditions for simple isotropic inextensible curve flow are expressed as a p...
Normal magic square and its some matrix properties
Some matrix properties on Eigen values, singular values, norm and condition number of normal magic square are presented in this paper. The properties are verified on a number of test examples and numerical results...
Independent Domination of Splitted Graphs
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...