ANTI SUPPORT STRONG DOMATIC PARTITION OF A FUZZY GRAPH

Cite this:
K. M. DHARMALINGAM, M. R. (2016). ANTI SUPPORT STRONG DOMATIC PARTITION OF A FUZZY GRAPH. Asian Journal of Current Engineering and Maths, 5(2), 41–43. https://doi.org/10.15520/ajcem.2016.vol5.iss2.52.pp41-43.
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
173
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

Let G = (; ) be a fuzzy graph. Let u be an element of V. Let
N(u) = {v ∈ V : (uv) = (u) ∧ (v)}. The fuzzy support of u is dened as the sum of the neighborhood degrees of the elements in N(u).
In this research work we introduce the concept of Anti Support strong
domatic partition of a Fuzzy graphs. The fuzzy support of a vertex is dened and domination based on the fuzzy support is considered. Several results involving this new fuzzy domination parameter are established. we also obtain the Anti fuzzy Support strong domatic number of G and is denoted by d s f(supp)(G).

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”