Fuzzy Magic Graphs-A Brief Study

Transcription

1 Volume 119 No , ISSN: (on-line version) url: Fuzzy Magic Graphs-A Brief Study 1 K.R. Sobha, 2 S. Chandra Kumar and 3 R.S. Sheeba 1 Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai, India. vijayakumar.sobha9@gmail.com 2 Department of Mathematics, Scott Chirstian College, Nagercoil, India. kumar.chandra82@gmail.com 3 P.G. Department of Mathematics, Sree Ayyappa College for Women, Chunkankadai, India. rssheeba1988@gmail.com Abstract Graph labeling is a currently emerging area in the research of graph theory. A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. A graph is said to be a fuzzy labeling graph if it has fuzzy labeling. A fuzzy labeling graph is said to be a fuzzy magic graph if σ(u)+µ(uv)+σ(v) has a same value for all u,v V which is denoted as m0(g).every fuzzy magic graph is a fuzzy labeling graph,but the converse is not true. The application of fuzzy magic graph is illustrated with suitable example. Key Words:Fuzzy graph, fuzzy labeling, fuzzy magic graph, wheel graph, fan graph. Subject Classification:TT1-AM

2 1. Introduction Fuzzy set is a newly emerging mathematical frame work exemplify the phenomenon of uncertainly in real life tribulations[1]. A fuzzy set is defined mathematically by assigning a value to each possible individual in the universe of discourse, representing its grade of membership which corresponds to the degree to which that individually similar or compatible with the concept represented the fuzzy set. Based on Zadeh s Fuzzy relation the definition of a fuzzy graph was introduced by Kauffmann in 1973.One of the first important papers on fuzzy graph theory was by Azriel Rosenfeld[4]. Rosenfeld introduce and examined such concepts as paths, connectedness, bridges, cut vertices, forests and trees [2].A fuzzy graph is the generalisation of the crisp graph. Therefore it is natural many properties are similar to crisp graph and also it deviates at many places [6]. The notation of magic graph was first introduced by Sunitha and Vijayakumar in 1964[3]. He defined a graph to be magic if it has an edge-labelling, within the range of real numbers, such that the sum of the labels around any vertex equals some constant, independent of the choice of vertex.kotzig and Rosa defined a magic labelling to be a total in which the labels are the integers from one to V G + E G 1.The sum of labels on an edge and its two endpoints is constant. In this paper, section 1 contain basic definitions and in section 2, fuzzy magic labelling for some graphs.e.g. Wheel, fan, paw, helm, butterfly. 2. Preliminaries Definition 2.1 Let U and V be two sets. Then ρ is said to be a fuzzy relation from U into V if ρ is a fuzzy set of UxV. Definition 2.2 A fuzzy graph G=(σ, μ) is a pair of functions σ: V 0,1 and μ: V V [0,1], where for all u,v V,we have μ(u, v) σ(u)ʌσ(v). Definition 2.3 A labeling of a graph is an assignment of a values to the vertices and the edges of a graph. Definition 2.4 A graph G=(σ, μ) is said to be a fuzzy labeling graph if σ: V 0,1 and μ: V V [0,1],is bijective such that the membership value of edges and vertices are distinct and μ u, v < σ u ʌσ(v) for all u, v V 1162

3 Example 2.1 Definition 2.5 A fuzzy labeling graph is said to be a fuzzy vertex magic graph if σ u + μ(u, v) + σ(v) has a same magic value for all u, v V which is denoted as m 0 G Definition 2.6 A fuzzy labeling graph is said to be a fuzzy edge magic graph if σ u + μ(u, v) + σ(v) has a same magic value for all u, v V which is denoted as M 0 G. Definition 2.7 A fuzzy labeling graph is said to be a fuzzy totally magic graph if and only if there exist a fuzzy labelling f which is both fuzzy edge magic with magic value M 0 and fuzzy vertex magic with magic value m 0.It is not required that M 0 =m 0. Definition 2.8 Let G= (V,μ, σ) be a fuzzy graph. Then the degree of a vertex v is defined by d(v) u v = µ(u, v) The minimum degree of G is δ G = ʌ{d(v)/v V} The maximum degree of G is G = ᴠ{d(v)/v V} Remark 2.1 Degree of any pair of vertices u,v in magic fuzzy graph always different from each other s and sum of degrees of nodes must be equal to twice the membership values of all arcs. Proposition 2.1 In a fuzzy magic graph G, the order of G is always greater than or equal to the size of G. i.e., O(G) S(G) In any fuzzy magic graph G, the following inequality holds: δ(g) (G) S(G) O(G) 1163

4 Proof Let G=(V,σ, μ) be any fuzzy magic graph, V, where σ fuzzy subset of V and μ fuzzy subset of VxV. Since δ(g) and (G) are minimum and maximum degree of G respectively. Clearly, δ G G.. (1) We have, O(G)= x V σ(x), the order of G S(G)= x y μ(x, y), the size of G By the definitions, i.e., S(G) G (2) μ(x, y) V{d(v)/v V} x y Also, in a fuzzy magic graph, the membership value of an edge is less than or equal to the minimum value of the edge connecting vertices. O G S G. (3) From (1),(2), and (3) we get, δ G G S G O G. Example 2.2 Consider a fuzzy graph G=(V,μ, σ).let V={v 1,v 2,v 3,v 4 },σ(v 1 )=0.4, σ(v 1 )=0.4, σ(v 2 )=0.3 σ(v 3 )=0.2, σ(v 4 )=0.26, μ(v 1,v 2 )=0.04, μ(v 2,v 3 )=0.09, μ(v 3,v 4 )=0.16,μ(v 2,v 4 )=0.02, μ(v 4,v 1 )=0.01,d(v 1 )=0.05,d(v 2 )=0.15, d(v 3 )=0.25,d(v 4 )=0.19,δ G = 0.05, (G)=0.25,S(G)=0.32,O(G)=1.16 Thus,δ G G S G O G. 1164

5 Some Examples of Fuzzy Magic Graphs Butterfly Graph The butterfly graph is a plannar undirected graph with 5 vertices and 6 edges. Example 2.3 Pan graph The Pan graph is the graph obtained by joining a cycle graph to a singleton graph with a bridge. The special case of the 3-pan graph is sometimes known as the paw graph and the 4-pan graph as the banner graph. Example 2.4 Wheel Graph A Wheel graph is a graph formed by connecting a single vertex to all the vertices of a cycle. For n 4 the wheel W n is defined to be the graph K 1 +C n

6 Example 2.5 Fan Graph A Fan graph F m, n is defined as the graph join K m +P n, where K m is the empty graph on m vertices and P n is the path graph on n vertices. The case m=1 corresponds to the usual fan graphs,while m=2 corresponds to the double fan, etc., Example 2.6 Helm Graph The helm graph is the graph obtained from an wheel graph by adjoining a pendent edge at each vertex of the cycle. 1166

7 Example 2.7 Bull Graph The bull graph is a planar undirected graph with 5 vertices and 5 edges,in the form of a triangle with two disjoint pendant edges. Example 2.8 Result: For n 1,a fuzzy Path P n is consider as a fuzzy magic graph, where n is length of P n. 3. Application of Fuzzy Vertex Magic Labeling A College wants to provide equal number of computer to its departments such that each computer is utilized either by one department or by two departments. Here the problem is to find the number of computers allocated to each department and also to find number of computers utilized by one department 1167

8 and number of computers used by two departments. Representing this situation as a graph by considering the departments as vertices and if two departments shares computers then there is an edge between the corresponding vertices. Considering the fuzzy vertex magic labeling to this graph we are able to get the solution needed. Problem A College wants to provide equal number of computers to its 5 departments Mathematics, English, Computer Science, Physics and Chemistry. In order to reduce the idle time of the computers the college allows few computers can be used by two departments. Suppose every department utilizing few computers which are utilized by other departments. Find the number of computers allotted to each department in percentage. Find the number of computers utilized by one department and by two departments in percentage. Solution For each i=1,2,3,4,5 we take the department D i as the vertex v i and if departments D i & D j are sharing computers then take an edge between v i & v j. The graph corresponding to the given circumstance is given in figure. Consider fuzzy vertex magic labeling of the given graph. 1168

9 Here at each vertex the sum of the label on the vertex and the labels on its incident edges is a constant k, this k gives the number of computers allotted to the computers utilized by one department and edge labels gives number of computers utilized by two departments. Here k=0.11 Thus each department provided with the percentage of 0.11 percentage of computers. Number of computers utilized by a one department and which are utilized by two departments are given in the following table 1. Table 1 Dept. D 1 D 2 D 3 D 4 D 5 D D D D D The entry in the diagonal of the table shows the number of computers utilized by one department in percentage. The other entries are the number of computers utilized by the respective pair of departments. 4. Conclusion In this paper we investigated different types of fuzzy magic graphs. In future we try to generalise the fuzzy wheel graph. References [1] Nagoor Gani A., Akram M., Novel properties of fuzzy labeling graphs, Journal of Mathematics (2014). [2] Nagoorgani A., Ahamed M.B., Order and size in fuzzy graph, Bulletin of Pure and Applied Sciences 22(1) (2003), [3] Jamil R.N., Javaid M., ur Rehman M.A., Kirmani K.N., On the construction of fuzzy magic graphs, Science International 28(3) (2016). [4] Zadeh L.A., Fuzzy sets, Information and control (1965), [5] Haray E., Graph theory, Addition Wesley, Reading, MA (1969). 1169

10 1170