Geodesic Iteration Number of g-contour of a Fuzzy Graph

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.


Introduction
Zadeh in 1965 [1] developed a mathematical phenomenon for describing the uncertainties prevailing in day-to-day life situations by introducing the concept of fuzzy sets. The theory of fuzzy graphs was later on developed by Rosenfeld in the year 1975 [2] along with Yeh and Bang [3]. Rosenfeld also obtained the fuzzy analogue of several graph theoretic concepts like paths, cycles, trees and connectedness along with some of their properties [2] and the concept of fuzzy trees [4], automorphism of fuzzy graphs [5], fuzzy interval graphs [6], cycles and co-cycles of fuzzy graphs [7] etc have been established by several authors during the course of time. Fuzzy groups and the notion of a metric in fuzzy graphs were introduced by Bhattacharya [8]. The concept of strong arcs [9] was introduced by Bhutani and Rosenfeld in the year 2003. The definition of fuzzy end nodes and some of their properties were established by the same authors in [10]. The concept of geodesic distance was introduced by Bhutani and Rosenfeld in [11]. Further studies based on geodesic distance were carried out by Sameena and Sunitha in [12][13][14]. Using this geodesic distance, Suvarna and Sunitha in [15] brought the concept of geodesic iteration number and geodesic number of a fuzzy graph into existence and studied some of the properties satisfied by them. The same concepts using µ-distance were introduced by Linda and Sunitha in [16]. Linda and Sunitha in [16] also introduced the concepts of g-periphery, g-eccentric fuzzy graph, g-boundary node and g-interior node in a fuzzy graph and studied some of their properties. Caceres et al. in 2005 [17] defined a node v ∈ V to be a contour node of a connected graph G: (V, E) if no neighbouring node of v has an eccentricity greater than eccentricity of v. In this paper, this concept is extended to fuzzy graphs using geodesic distance and is named as g-contour nodes and the set of all g-contour nodes of the fuzzy graph G is called the g-contour of G. It is proved that every extreme node of G is a g-contour node of G but not conversely. The geodesic iteration number of the g-contour of a fuzzy graph is discussed. It is also proved that the g-contour of g-self centred fuzzy graphs and of fuzzy trees is geodesic covers. Also, for certain categories of fuzzy graphs, their geodesic iteration number is found to coincide with that of their g-contours.

Preliminaries
In this section, a brief summary of some basic definitions in fuzzy graphs is given. Definition 2.1: [18] A fuzzy graph is a triplet G: (V, σ , µ) where σ is a fuzzy subset of a set V of nodes and µ is a fuzzy relation on σ . That is, µ(u, v) ≤ σ (u) and σ (v), ∀u, v ∈ V. We assume that V is finite and non-empty, µ is reflexive (i.e. µ(x, x) = σ (x), ∀x) and symmetric (i.e. µ(x, y) = µ(y, x), ∀(x, y)). Also we denote the underlying crisp graph [19] by G * : (σ * , µ * ) where σ * = {u ∈ V: σ (u) > 0} and µ * = {(u, v) ∈ V × V: µ(u, v) > 0}. Here we assume σ * = V. Definition 2.2: [18] A fuzzy graph H: (V, τ , ν) is called a partial fuzzy subgraph of G: (V, σ , µ) if τ (u) ≤ σ (u) for every u ∈ τ * and ν(u, v) ≤ µ(u, v) ∀(u, v) ∈ ν * . Definition 2.3: [18] The fuzzy graph H: (V, τ , ν) is called a fuzzy subgraph of G: (V, σ , µ) if τ (u) = σ (u), ∀u ∈ τ * and ν(u, v) = µ(u, v), ∀(u, v) ∈ ν * and if in addition τ * = σ * , then H is called a spanning fuzzy subgraph of G. Definition 2.4: [18] A fuzzy graph H: (P, τ , ν) is called a fuzzy subgraph of G: Definition 2.5: [18] A fuzzy graph G: Definition 2.6: [18] A sequence of distinct nodes u 0 , u 1 , ... , u n such that µ(u i−1 , u i ) > 0, i = 1, 2, 3, . . . , n is called a path P n of length n. Definition 2.7: [4] An arc of G: (V, σ , µ) with least non-zero membership value is a weakest arc of G. The degree of membership of a weakest arc in the path is defined as the strength of the path. The path becomes a cycle if u 0 = u n , n ≥ 3 and a cycle is called a fuzzy cycle if it contains more than one weakest arc. Definition 2.8: [18] The strength of connectedness between two nodes u and v is the maximum of the strengths of all paths between u and v and is denoted by CONN G (u, v). The fuzzy graph G: (V, σ , µ) is said to be connected if CONN G (u, v) > 0 for every u, v in σ * . Definition 2.9: [9] An arc (u, v) of a fuzzy graph is called strong if its weight is at least as great as the strength of connectedness of its end nodes u, v when the arc (u, v) is deleted and a u − v path P is called a strong path if P contains only strong arcs. Definition 2.10: [2] A connected fuzzy graph G: (V, σ , µ) is called a fuzzy tree if it has a spanning fuzzy subgraph F: (V, σ , ν), which is a tree such that for all arcs (u, v) not in F, Definition 2.11: [10] Two nodes u and v in G are neighbours (adjacent) if µ(u, v) > 0 and v is called a strong neighbour of u if the arc (u, v) is strong. The set of all neighbours of u is denoted by N(u) and the set of all strong neighbours of u is denoted by N s (u). A node v is called a fuzzy end node of G if it has at most one strong neighbour in G. Definition 2.12: [5] Two fuzzy graphs G: Definition 2.13: [11] A strong path P from x to y is called geodesic if there is no shorter strong path from x to y and the length of a u − v geodesic is the geodesic distance from u to v denoted by d g (u, v). Definition 2.14: [11] The geodesic eccentricity (g-eccentricity) e g (u) of a node u in a connected fuzzy graph G: (V, σ , µ) is given by e g (u) = max v∈V d g (u, v). The maximum g-eccentricity among the nodes of G is its g-diameter denoted by d g (G). The minimum g-eccentricity among the nodes of G is its g-radius denoted by r g (G). Definition 2.15: [11] A node with minimum e g is called a g-central node and a node with maximum e g is called a g-peripheral node. Let C g (G) be the set of g-central nodes of G. Then the fuzzy subgraph induced by C g (G), denoted by C g (G) , is called the g-center of G. Definition 2.16: [12] A connected fuzzy graph G: The following definitions and results have been taken from [11,15]. Definition 2.17: [11] Let S be a set of nodes of a connected fuzzy graph G: (V, σ , µ). The geodesic closure (S) of S is the set of all nodes in S together with the nodes that lie on geodesics between nodes of S. S is said to be convex if S contains all nodes of every u − v geodesic for all u, v in S., i.e. if (S) = S. S is said to be geodesic cover (geodesic set) of G if (S) = V (G) and any cover of G with minimum number of nodes is called a geodesic basis for G. Order of a geodesic basis is the number of nodes in it. Definition 2.18: [15] Let S be a set of nodes of a connected fuzzy graph G: (V, σ , µ) and let S 0 , S 1 , S 2 , . . . are geodesic closures, where S 0 = S, S 1 = (S), S 2 = (S 1 ) = ((S)), . . . The smallest value of n so that S n = S n+1 is called the geodesic iteration number, denoted by gin(S) and the resulting set is called the convex hull of S in G, denoted by [S]. Also, gin(G) = Max S⊆V (gin(S)). Proposition 2.19: [11] A fuzzy tree has a unique geodesic basis consisting of its fuzzy end nodes.

The g-contour of a Fuzzy Graph
Caceres et al. in [17] defined a node v ∈ V to be a contour node of a connected graph G: (V, E) if no neighbouring node of v has an eccentricity greater than eccentricity of v. The contour of G, Ct(G), is the set formed by all contour nodes of G. In this section, this concept is extended to fuzzy graphs using geodesic distance and is renamed as g-contour of a fuzzy graph, Ct g (G). It is proved that every extreme node of G is a g-contour node of G but not conversely. It is also proved that the g-contour of g-self centred fuzzy graphs and of fuzzy trees is geodesic covers.

Definition 3.1:
A g-contour node of a fuzzy graph G: (V, σ , µ) is a node v whose geccentricity is greater or equal to that of every strong neighbour of v. The g-contour of G is the set of g-contour nodes in V (G) and is denoted as Ct g (G). That is, Let S be a set of nodes in a fuzzy graph G and let S be the fuzzy subgraph of G induced by S. A vertex u ∈ S is said to be a g-contour node of S if e g (u) ≥ e g (v) for every strong neighbour v of u in S . The set of all g-contour nodes of S is called the g-contour of S and is denoted by Ct g (S).

Example 3.2:
Consider the fuzzy graph G given in Figure 1(a).
The g-eccentricities of each node is given in brackets. Here x, y and z are the g-contour nodes of G and so Ct g (G) = {x, y, z}. If S = {x, y, z}, then the fuzzy subgraph of G induced by S, S , is as given in Figure 1 The nodes x and z in S are the g-contour nodes having g-eccentricity 2 whereas y has g-eccentricity 1 and so is not a g-contour node. Therefore Ct g (S) = {x, z}.

Remark 3.3:
If G: (V, σ , µ) is a fuzzy graph and x ∈ V(G), then there is a g-eccentric node for x that is a g-contour node. However note that not all the g-eccentric nodes of a node x in G is a g-contour node of G.

Example 3.4:
Consider the fuzzy graph G given in Figure 2, where the g-eccentricities of each node are given in brackets.
Here, Ct g (G) = {p, r}. Note that the node x has g-eccentricity 1 and q is a g-eccentric node of x which is not a g-contour node. Proposition 3.5: Let G: (V, σ , µ) be a g-self centred fuzzy graph. Then the g-contour of G, Ct g (G), is a geodesic cover of G.
Proof: Since G is a g-self centred fuzzy graph, all nodes of G have the same g-eccentricity and so by Definition 3.1, each node is a g-contour node. Therefore Ct g (G) = V(G) and so (Ct g (G)) = (V(G)) = V(G). Thus the g-contour of G is a geodesic cover of G.

Remark 3.6:
The converse of Proposition 3.5 is not true. That is, if Ct g (G) is a geodesic cover of a fuzzy graph G, then G need not be g-self centred.

Example 3.7:
Consider the fuzzy tree G: (V, σ , µ) given in Figure 3. The g-eccentricities of each node are given in brackets.
Note that the fuzzy tree G is not g-self centred. Here Ct g (G) = {u, v, w} and since the node x lies on every geodesic joining pair of nodes of Ct g (G), we get (Ct g (G)) = {u, v, w, x} = V (G) and so Ct g (G) is a geodesic cover of G.   Proof: A node in a fuzzy tree G is a g-eccentric node of G if and only if it is a g-peripheral node of G [13]. Therefore, all g-eccentric nodes of x are g-peripheral nodes and hence by Definition 3.1, they are all g-contour nodes of G. Proposition 3.9: Let G: (V, σ , µ) be a fuzzy tree. Then the g-contour of G, Ct g (G), is a geodesic cover of G.
Since v is not a gcontour node of G, there is some strong neighbour u 1 of G such that e g (u 1 ) > e g (v). If u 1 is not a g-contour node of G, then u 1 has a strong neighbour u 2 such that e g (u 2 ) > e g (u 1 ). Continuing in this way, we get a sequence u 1 , u 2 , . . . of nodes such that e g (u 1 ) < e g (u 2 ) < ... . Since the fuzzy graph is finite, the sequence terminates with some node u t which has the property that its g-eccentricity is at least as large as that of its strong neighbours. Such a node must necessarily be a g-contour node. By Proposition 3.8, we know that u t has a geccentric node u t * that belongs to the g-contour of G. Since e g (u t ) > e g (u t−1 ) and since G being a fuzzy tree has exactly one geodesic path between two nodes of G, it follows that u t * is also a g-eccentric node for u t−1 and thus the strong arc (u t , u t−1 ) followed by the u t−1 − u t * geodesic is a u t − u t * geodesic that contains u t−1 . Continuing in this manner, we see that the path u t , u t−1 , ... , u 1 , v followed by a v− u t * geodesic is a u t − u t * geodesic that contains v. Since u t and u t * are both g-contour nodes, the result follows.

Definition 3.10:
A node v in a fuzzy graph G: (V, σ , µ) is called an extreme node of G if the fuzzy subgraph induced by its neighbours is a complete fuzzy graph. Also, the number of extreme nodes in G is denoted by ex(G).

Proposition 3.11:
An extreme node of a fuzzy graph G: (V, σ , µ) is a g-contour node of G.
Proof: Let u ∈ V (G) be an extreme node of G. We now show that u is a g-contour node of G. Let v be a strong neighbour of u and let v * be a g-eccentric node for v. That is, Suppose on the contrary that e g (u) Then the node following u on P, say w, is adjacent to v since u is an extreme node. However, then the arc (v, w) followed by the and therefore u is a g-contour node of G. Remark 3.12: Converse of Proposition 3.11 is not true as seen from Example 3.13. Example 3.13: Consider the fuzzy graph G given in Figure 4. The g-eccentricities of each node is given in brackets.
Here the node x is a g-contour node of G. But it is not an extreme node since the fuzzy subgraph induced by its neighbours is not a complete fuzzy graph. Proposition 3.14: In a complete fuzzy graph G: (V, σ , µ), each node of G is a g-contour node as well as an extreme node. Proof: By Definition 3.10, it is clear that each node in a complete fuzzy graph G is an extreme node. Moreover, since all arcs in a complete fuzzy graph are strong [9], geccentricity of each node is 1. Therefore each node is a g-contour node. Hence

Geodesic iteration number of g-Contour of a fuzzy graph
In this section, the geodesic iteration number of the g-contour of a fuzzy graph is obtained.
The geodesic iteration number of certain categories of fuzzy graphs is found to coincide with the geodesic iteration number of their g-contours.  Proof: Suppose to the contrary that S =[Ct g (S)]. Since S is a convex set, by Proposition 4.1, , there exists a strong neighbour v of u in S such that e g (v) > e g (u) and by our choice of u,

Remark 4.3:
The above result shows that the convex hull of the g-contour set of a convex set of nodes in a fuzzy graph is the entire set. Thus the convex hull of the g-contour of a fuzzy graph coincides with the node set of the fuzzy graph. Hence gin(Ct g (G)) is the minimum k, k ≥ 0, such that (Ct g (G)) k = V (G).

Example 4.4:
Consider the fuzzy graph given in Figure 5. The g-eccentricities of each node are given in brackets.  Proof: Suppose G is a g-self centred fuzzy graph. Then all nodes of G have the same geccentricity and so by Definition 3.1, each node is a g-contour node.
Therefore Ct g (G) = V (G) and so gin(Ct g (G)) = 0. Conversely suppose that gin(Ct g (G)) = 0. Then Ct g (G) = V (G) and so each node of G is a g-contour node. Then by Definition 3.1, it follows that each node has the same g-eccentricity and so G is g-self centred fuzzy graph. Proof: For a complete fuzzy graph G, each arc is the geodesic between its end nodes. So, for any S ⊆ V (G), each pair of nodes in S is connected by a geodesic.
i.e. no geodesic between a pair of nodes of S contains another node. So, S 1 = (S) = S = S 0 . This is true for any S ⊆ V (G). Hence gin(G) = 0. Also, since all arcs in a complete fuzzy graph are strong [9], g-eccentricity of each node is 1 and so G is g-self centred. Therefore, by Proposition 4.5, gin(Ct g (G)) = 0. Thus we get gin(G) = gin(Ct g (G)).

Example 4.8:
Consider the fuzzy cycle G given in Figure 6.

Proof:
Since a fuzzy tree is not g-self centred, it follows from Proposition 4.5 that gin(Ct g (G)) =0 and so Ct g (G) =V(G). But by Proposition 3.9, Ct g (G) is a geodesic cover of G. Therefore (Ct g (G)) = V(G) and so by Remark 4.3, gin(Ct g (G)) = 1. Also for a fuzzy tree G, Also, for all other subsets S of V(G), gin(S) is either 0 or 1 and so gin(G) = max{0, 1} = 1. Therefore, gin(G) = gin(Ct g (G)).

Application of g-contour Nodes in Telecommunication Systems
Telecommunication is the exchange of information over any distance by a telecommunication path. Telecommunication occurs when the exchange of information between communication participants includes the use of technology. It is one of the most essential and unavoidable system in our daily life today. A revolution in wireless communication began in the first decade of the twentieth century with the pioneering developments in radio communications. This paved path for mobile phones that are wireless devices used to make and receive telephone calls over a radio link while moving around a wide geographic area. However, this technological device has gradually become a threat to our land line telecommunication networks. The number of land line subscribers continuously decreases due to upgrades in digital technology and the conveniences that come with switching to wireless (cellular) or Internet-based alternatives. Churn is a term used by companies to denote the loss of customers. Churn prediction is essential for businesses as it helps to detect customers who are likely to cancel a subscription or service. Churn of customers in telecommunication is a big problem for service providers and hence making a list of churning persons is an important task for service providers. Thus in order to reduce churning in the land line telecommunication system, the service providers give attractive offers and facilities for calls made within the system such as free calls on public holidays and reduced tariff on other days and so on. Also high speed net facilities such as broad band has also helped to a great extend in reducing the churning percentage among customers. A service provider gives more importance to the customer having more connected people. By canvassing these 'connected people' and brain washing them about the offers and facilities provided by the land line communication system, the service provider might succeed to a great extend in reducing the churn in the network and also in including new customers in the network. By repeating this process with the connections of these 'connected people', a wider access to the network is provided until everyone in the network has been canvassed and those about to churn are identified. This repeated process of canvassing customers can be compared to the iterative method of taking geodesic closures (Definition 2.17) among nodes in a fuzzy graph.

Representation of Land Line Telecommunication System by a Fuzzy Graph Model
Samanta and Pal in [20] suggested that a social network can be represented by a fuzzy graph, there by introducing the concept of fuzzy social network. A telecommunication network is a social network and the same authors in [21] discussed telecommunication network by using a fuzzy graph model. In this section, a method to represent the land line telecommunication network (LTN) by an undirected fuzzy graph is proposed by modifying the membership values of the links in the telecommunication network suggested by Samanta and Pal in [21]. The modifications include representation of telecommunication system by an undirected fuzzy graph G:(V, σ , µ) instead of the directed fuzzy graph G → (V, σ , μ → ) where the membership value μ → (a, b) of the link between two customers a and b depends on t, the outgoing call time of a to b, whereas in G, the membership value µ(a, b) depends on the variable t , the sum of out-going call durations of a to b and of b to a. And using this fuzzy graph representation G: (V, σ , µ) of LTN, a formula to determine the central persons in the network is obtained in Section 5.5. It is further established that the g-contour nodes of G: (V, σ , µ) are indeed the central persons in the network and that by focusing on these g-contour nodes, a service provider can canvass each person falling in the geodesic path between them. If all the customers get covered, he has completed his mission, or else he again canvasses those falling in the geodesic path between customers in its geodesic closure. Thus this repeated process is equivalent to the iterative method of taking geodesic closures and the geodesic iteration number of g-contour nodes indicates the minimum number of times a service provider has to set out canvassing each customer in LTN until all the customers get covered. Let

Membership Values of Customers in LTN
Before defining the membership values of the customers in V 1 , Samanta and Pal in [21] defined a co-related term 'recognition number' as follows. In every society, recognition of each person is measured by some members of the society. In LTN, the number of those members is taken as the recognition number. It is denoted by N. This recognition number (N) may not be equal for all social networks. But it should be pre-determined for a particular social network. For example, a social network may assume 3 as recognition number, i.e. for each new member of the social network, recommendation of 3 persons is necessary. Another social network may use another value of N. Here, let V 1 = {c 1 , c 2 , ... , c n } be the set of all registered customers in the telecommunication network LTN. Let ϕ: V 1 → [0, 1] be a mapping such that ϕ(c k ) = e k /N, Where N is fixed integer for the network and e k is the number of distinct connected people (i.e. distinct phone numbers) of the customer c k ∈ V 1 per unit interval of time in the network.

Membership Values of Customers of Other Network Connected to LTN
We are interested in those customers of other networks who are connected to the customers of LTN. Here, V 2 = {c n+1 , c n+2 , ... , c m } are the outside customers connected to the members of LTN. Before introducing the membership values of customers outside LTN, a co-related term 'satisfied time of calling' is defined as in [21]. If an outside customer of LTN calls certain amount of time to customers of LTN, then the outside customer is also valuable for LTN. We take T, a real positive number, as fixed amount of time. If the call duration of an outside customer to LTN is greater than T, the customer is taken as valuable. This fixed amount of time is called Satisfied time of calling. Let out-going call time of c k ∈ V 2 to any customer of LTN be t and T be the satisfied time of calling of a customer to LTN. Let the mapping σ : V → [0, 1] be such that σ (c k ) = ϕ(c k ) for all c k ∈ V 1 and for all c k ∈ V 2 ,

Membership Value of a Link Between Two Customers
In the telecom world, the more people talk to each other, the closer they get. So strength between two customers depends on how much time they call to each other by phones per unit interval of time. Note that in [21], the telecommunication system is represented by a directed fuzzy graph G → = (V, σ , μ → ) where the membership value of a link between customers is given by Where t is the duration of out-going calls per unit interval of time from c i to c j and T is the satisfied time of calling.
The underlying fuzzy graph of G → is denoted by for all a, b ∈ V. Now in this paper, we consider only undirected fuzzy graphs and accordingly, the membership values of links between customers is given by the mapping µ: Where t is the sum of out-going call durations of c i to c j and of c j to c i per unit interval of time and T, satisfied time of calling, is fixed positive real number for a network.

Central Person in LTN
One of the most widely studied concepts in social network analysis is that of centrality in a network. Numerous measures, including degree centrality, closeness, eigenvector centrality, information centrality, etc. have been developed to define the concept of centrality in a network. Degree centrality measures the direct linkage of a customer to others. In all kinds of networks, central persons are more valuable than others as they can send messages to more people and also can collect more information. However, degree centrality only measures the number of direct friends (or linkages). So it does not measure the number of connected people by a path. It may be noted that friend of a friend shares or collects information to or from the person. The amount of information shared between two customers in a telecommunication network is directly proportional to the calling time between them. So importance of a linkage in a telecom network will gradually decrease from a person to another person having low calling time. The δ-arcs in the fuzzy graph representation of LTN indicate linkages having less priority due to low calling time taken by the customers. In fuzzy social network (FSN), Sovan Samanta and Madhumangal Pal defined centrality [20] of a person as the weighted sum of fuzzy distances of connected persons along certain paths. The same authors in [21] defined centrality of a customer in fuzzy telecommunication network (FTN) as the weighted sum of fuzzy distances of directly connected customers and star customers connected by a certain path. In this paper, we define centrality of a customer as the weighted sum of fuzzy distances of connected persons along geodesic paths where the weights are g-eccentricities of the customers.
In LTN, if a customer c k+1 is directly connected with the customer c k , then we say that c k+1 is distance-1 friend of c k . Let the set of all distance-1 friends of c k be denoted by d 1 (c k ).
That is, Similarly, if there is a geodesic path (i.e. shortest strong path) between c k and c k+1 containing k edges or links, then c k+1 is a distance-k friend of c k . That Let p i = c 1 , c 2 , ... , c k = p j be the customers on the geodesic path between p i and p j . Samanta and Pal in [20] defined fuzzy distance D f (p i , p j ) between p i and p j along this path as D f (p i , p j ) = k−1 l=1 μ(c l , c l+1 ). In a network, it may be observed that there are multiple geodesic paths between two customers. In LTN, those geodesic paths of same length whose fuzzy distance D f is maximum are considered. If there are k links in this path of maximum fuzzy distance, then we denote this distance by D f k . That is, D f k (p i , p j ) represents the fuzzy distance between the customers P i and P j along a geodesic path containing exactly k links. We calculate the g-eccentricities of each node (customer) in the fuzzy graph representation of LTN. Suppose that a customer c k has g-eccentricity p, then it means that he/she has at most distance-p friends. Then the centrality C(c k ) of a customer c k of LTN is evaluated as follows

g-Contour Nodes as Central Persons in LTN
In this paper, we show that all g-contour nodes of the fuzzy graph representation of LTN are central persons of the LTN and by focusing on these central persons, a service provider can canvass each person falling in the geodesic path between them. That is, by focusing on the g-contour nodes S = Ct g (G), the service provider manages to canvass all persons falling in the geodesic closure S 1 = (S). If (S) =V (G), he again canvasses those falling in the geodesic paths between members of (S), i.e. S 2 = (S 1 ) = ((S)). Then again, if S 2 =V(G), he canvasses those falling in S 3 = (S 2 ) = ((S 1 )) and so on until S k = V(G). The minimum k for which S k = V(G), which is equal to gin(Ct g (G)), indicates the minimum number of times a service provider sets out for canvassing the customers in the network until all the customers in the network are covered. Thus in this paper, we show that the  repeated process of canvassing customers can be compared to the iterative method of taking geodesic closures among the g-contour nodes (central customers) in the fuzzy graph representation of LTN and the geodesic iteration number of g-contour nodes determines the minimum number of steps required for a service provider to set out and canvass each and every customer in LTN. Here, fix recognition number as 4 and satisfied time of calling as 30 min per interval of time. To illustrate our model, we assume that the customers are connected with some other people as per data given in Table 1. Based on this data, the σ -values of each customer is evaluated and shown in column 3 of the same table.

An Example of the Land Line Telecommunication System LTN
From Table 1, we see that A 1 ∈ V 1 has only 1 connected customer. So σ (A 1 ) = ϕ( Similarly, membership values of other customers in LTN are calculated. Now to assign the membership values of the customers outside LTN, we have to collect the duration of out-going calls made by them to the customers of LTN. The amount of time is shown in Table 2. Here, B 1 has out-going call duration say 100 min to A 1 and 80 min to A 2 . So, total outgoing call duration of B 1 to LTN is 180 min. This amount of time is bigger than the satisfied calling   Table 3. For example, µ(A 3 , A 4 ) = 15/30 (1 and 1) = 0.5. In Table 4, link membership values between two customers, one from LTN and the other from another network are listed below.
Using the definition of centrality given in Section 5.5, the centrality of each customer in Figure 7 can be evaluated as follows.
Centrality of A1: Also, Again, Similarly, The centrality of the customer A 1 is thus calculated as follows. Similarly, centralities of other customers in the network are as given in Table 5.
Note that centrality increases with increasing g-eccentricity. Thus all g-contour nodes of the fuzzy graph can be considered to be central persons of the telecommunication network as they have wider access to the remaining customers of LTN. By focusing on these central customers of LTN, a service provider decides to canvass each person falling in the geodesic path between them.
In other words, in Figure 7, S = {A 1 , A 2 , B 3 , B 4 , B 5 } = Ct g (G) is the set of central customers in the fuzzy graph G: (V, σ , µ) given in Figure 7. Taking its closure, we get (S) = V (G) − B 2 . That is, by focusing on the g-contour nodes A 1 , A 2 , B 3 , B 4 and B 5 , the service provider manages to canvass all except one person B 2 in the network. Since (S) =V(G), he again canvasses those falling in the geodesic paths between members of (S), i.e. S 2 = ((S)).
Here S 2 = ((S)) = V(G) and hence each and every customer in the selected network gets covered.
In this example, the minimum k for which S k = V(G) is 2 (i.e. gin(Ct g (G)) = 2) which indicates that a service provider has to set out twice in order to canvass each and every customer in the land line telecommunication network given in Figure 7.

Conclusion
In this paper, the concept of contour nodes in crisp graphs is extended to fuzzy graphs using geodesic distance and is named as g-contour nodes and the set of all g-contour nodes of the fuzzy graph G is called the g-contour of G. It is proved that every extreme node of G is a g-contour node of G but not conversely. The geodesic iteration number of the g-contour of a fuzzy graph is obtained. It is also proved that the g-contour of g-self centred fuzzy graphs and of fuzzy trees is geodesic covers. Also, for certain categories of fuzzy graphs, their geodesic iteration number is found to coincide with that of their g-contours. An application of g-contour nodes in the land line telecommunication system is demonstrated.

Notes on contributors
Sameeha Rehmani, working as an Assistant Professor in the Department of Mathematics, Sullamussalam Science College, Areacode. Kerala, India. E-mail: sameeha.rehmani@gmail.com. Her area of specialisation is Fuzzy Graph theory. She has pursued her PhD from National Institute of Technology, Calicut, under the guidance of Dr. Sunitha. M. S. M. S. Sunitha, working as Professor in the Department of Mathematics, National Institute of Technology Calicut, Kerala, India. E-mail: sunitha@nitc.ac.in. Her area of specialisation is Fuzzy Graph Theory. She has pursued her PhD from M. G. University, under the Guidance of Dr. A. Vijayakumar. She has guided eleven PhDs and has published several papers in the area of Fuzzy graphs.