Geodesic Iteration Number of g-contour of a Fuzzy Graph. Issue 2 (3rd April 2019)

• Record Type: Journal Article
• Authors: Rehmani, Sameeha; Sunitha, M. S.
• Is Part Of: Fuzzy information and engineering. Volume 11:Issue 2(2019)
• Page Start: 186
• Page End: 202
• Publication Date: 2019-04-03
• Subjects: g-eccentricity -- g-contour node -- extreme node -- geodesic iteration number; 05C72 -- 05C12 -- 05C38 -- 05C40 -- 90C35; Fuzzy systems -- Periodicals; Intelligent control systems -- Periodicals; 629.89
• DOI: 10.1080/16168658.2021.1886819
• Languages: English
• ISSNs: 1616-8658

Abstract

Abstract : Purpose: In this paper, we intent to introduce the concept of g -contour nodes in fuzzy graphs and demonstrate an application of g -contour nodes in Land line telecommunication Network. Design/approach: The concept of g -contour nodes in Fuzzy graphs is explained and is supported by several examples. The geodesic iteration number of g -contour nodes in fuzzy graphs is obtained. An application of geodesic iteration number of g -contour nodes for determining the central persons in the land-line telecommunication network (LTN) is demonstrated, by means of which churning in the land-line telecommunication system can be reduced by providing a step-wise method for canvassing each and every customer in the network. Findings: It is proved that every extreme node of G is a g -contour node of G but not conversely. The g -contour of g -self-centred fuzzy graphs and of fuzzy trees is found to be a geodesic cover. The geodesic iteration number of the g -contour of a fuzzy graph is obtained. The geodesic iteration number of complete fuzzy graphs and of fuzzy trees is proved to coincide with the geodesic iteration number of their g -contours.