Connected g-Eccentric Domination in Fuzzy Graph
Main Article Content
Abstract
A dominating set in a fuzzy graph G(τ,ν) is said to be a g-eccentric dominating set if for each vertex in , at least one g-eccentric vertex of in . A g-eccentric dominating set of is said to be connected g-eccentric dominating set if the induced sub graph is connected. This study proposes the connected g-eccentric point set and connected g-eccentric dominating set. Some standard fuzzy graphs have a connected g-eccentric domination number associated with them, which must be established. The connected g-eccentric domination number and its bounds are studied.
Article Details
Issue
Section
Articles