Support Strong Degree Sequence in Fuzzy Graphs

Cite this:
M. Revathi, K. M. D. (2015). Support Strong Degree Sequence in Fuzzy Graphs. Asian Journal of Current Engineering and Maths, 4(2), 24–26. https://doi.org/10.15520/ajcem.2015.vol4.iss2.25.pp24-26.
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
185
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

Let G=( ) be a fuzzy graph. Let u be an element of V. Let . The fuzzy support of u is defined as the sum of the neighbourhood degrees of the elements in N(u).Then the fuzzy support strong degree of

u= It is denoted by degs f(supp) (u). Arrange the support strong degrees of vertices of G in descending order. Let (d1,d2,……,dn) with di≥di+1 be the fuzzy support strong degree sequence of G. In this research work we introduce the concept of support strong degree sequence in fuzzy graphs.  The fuzzy support of a vertex is defined and domination based on the fuzzy support is considered. Several results involving this new fuzzy domination parameter are established.

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