Degree Equitable Connected Domination in Fuzzy Graphs

Cite this:
M. Rani, K. D. (2015). Degree Equitable Connected Domination in Fuzzy Graphs. Asian Journal of Current Engineering and Maths, 4(3), 37–39. https://doi.org/10.15520/ajcem.2015.vol4.iss3.31.pp37-39.
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
147
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

Let  be a fuzzy graph. Let  and  be two vertices of . A fuzzy connected dominating set  is to be a fuzzy equitable connected dominating set if for every  there exists a vertex  such that  and  where  denotes degree of vertex  and  denotes the degree of vertex  and . The minimum cardinality of fuzzy equitable connected domination set is denoted by . In this paper we introduce the concept of fuzzy equitable connected dominating set. Also we obtain some interesting results for this new parameter in equitable connected domination in fuzzy graphs.

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.”