A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Characterisation of Restrained Domination number and Chromatic number of a Fuzzy Graph

*
Innovative Trends in Applied Physical, Chemical, Mathematical Sciences and Emerging Energy Technology for Sustainable Development
*
unpublished

Let (, ,) be a simple undirected fuzzy graph. A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. A subset S of V is said to be a restrained dominating set if every vertex in V-S is adjacent to atleast one vertex in S as well as adjacent to atleast one vertex in V-S. The restrained domination number of a fuzzy graph (, ,)is denoted by (G) which is the smallest cardinality of a restrained dominating set of G. The minimum number of

fatcat:gjlinqbmb5fwfk7wtbv4egkbjm