Abstract
The concepts of coverage and connectivity plays an important role in both theory and application of fuzzy graphs. In this paper a characterization of fuzzy detour g-eccentric node is obtained. The concepts of fuzzy detour g-boundary nodes and fuzzy detour g-interior nodes in a fuzzy graph are introduced. We demonstrate the relationship between fuzzy cut node and fuzzy detour g-boundary node. Also some properties of fuzzy detour g-boundary nodes, fuzzy detour g-interior nodes and complete nodes are discussed. Fuzzy detour g-interior node and fuzzy detour g-boundary node of a fuzzy tree are characterized using its maximum spanning tree.
Get full access to this article
View all access options for this article.