Fuzzy Norm on Fuzzy Autocatalytic Set (FACS) of Fuzzy Graph Type-3

Size: px
Start display at page:

Download "Fuzzy Norm on Fuzzy Autocatalytic Set (FACS) of Fuzzy Graph Type-3"

Transcription

1 ISSN Mathematics and Statistics Journal home page: (2): Fuzzy Norm on Fuzzy Autocatalytic Set (FACS) of Fuzzy Graph Type-3 1 Umilkeram Qasim Obaid and 2 Tahir Ahmad 1 Department of Mathematics, College of Science, AL-Mustansiriya University, Baghdad, Iraq. 2 Department of Mathematical Science and Centre for Sustainable Nano Materials, IbnuSina Institute for Scientific and Industrial Research, Universiti Teknologi Malaysia, Skudai, Johor, Malaysia. Address For Correspondence: Umilkeram Qasim Obaid, Department of Mathematics, College of Science, AL-Mustansiriya University, Baghdad, Iraq. umilkeram@yahoo.com ToCite ThisArticle:UmilkeramQasimObaid and 1Tahir Ahmad. Fuzzy Norm on Fuzzy Autocatalytic Set (FACS) of Fuzzy Graph Type-3. Mathematics and Statistics Journal, 3(1): 12-24, 2017 A B S T R A C T Fuzzy Autocatalytic Set (FACS) of fuzzy graph Type-3 particularly on the fuzziness of normed structure of FACS and its relation to cycles in FACS is explored. In other words, a fuzzy norm on a FT3-cycle space of FACS which will called a fuzzy normed cycle space of FACSis given and interpreted the catalytic chain reaction between two cycles in FT3-cycle space of FACS. We investigate some of its important properties such as the notions of convergence, Cauchyness and completeness infuzzy normed cycle space of FACS. Then, the application of the fuzzy normed cycle space of FACS to the clinical incineration process is elaborated. Keywords:FT3-cycle space of FACS, fuzzy autocatalytic set, fuzzy graph, incineration process, normed space of FACS INTRODUCTION Fuzzy theory has been studied for quite extensively in conjunction with problems in mathematics subjects including set theory, graph theory, measure theory, control theory, differential equations, topology and most recently functional analysis. The fuzzy characteristics that were mainly introduced by Zadeh in 1965 were merged into the crisp graph. In this regard, Rosenfeld (1975)unveiled his design for the basic structure of fuzzy graph. Ever since that, fuzzy graph has been promptly expanded and implemented in diverse fields. The study on a modeling of clinical waste incineration process in Malacca (Sabariah, 2005; Tahir et al., 2010) is a significant example of the implementation of fuzzy graph theory. The notion of an Autocatalytic Set (ACS) as initiated by Jain and Krishna (1998; 2003) has been integrated with graph theoretical concepts in Nevertheless, ACS was deficient in explaining the incineration process (Sabariahet al., 2009). This led to the development of the modeling work of the process and adapted the fuzzy logic as an integral part of the system. In other words, fuzzy graph had succeeded to apply the modeling of this process as presented in Figure 1.Six main variables specified in the process were modelled as vertices (nodes) and the catalytic relationships were presented as edges (links). Representing the process as fuzzy graph made amalgamation three notions which are graph, autocatalytic set and fuzzy. This study was focused on fuzzy graph of type-3 and innovated a fresh notion called Fuzzy Autocatalytic Set (FACS) of fuzzy graph type-3. It was shown that the modeling fuzzy work (FACS) of the incineration process was more precise and suitable in describing the dynamics of this process (Tahir et al., 2010). Published Online in 19 May 2017 Open Access Journal Published BY IWNEST Publication 2017 IWNEST Publisher All rights reserved This work is licensed under the Creative Commons Attribution International License (CCBY).

2 13 UmilkeramQasimObaid and Tahir Ahmad, 2017 V 1 : Waste (particularly clinical waste) V 2 : Fuel V 3 : Oxygen V 4 : Carbon Dioxide V 5 : Carbon Monoxide V 6 : Other Gases including Water Fig. 1: FACS of fuzzy graph Type-3 for the incineration process (Tahir etal., 2010) The structure of FACS with its relation to normed space and its cycles was taken into consideration in more investigation on FACS of fuzzy graph Type-3 and the richness of directed graph through functional analysis advantages (Umilkeram and Tahir, 2016). More precisely, a new concept namely normed space of FACS of fuzzy graph Type-3 was defined and implemented in the modelling of the incineration process. This paper focuses on the representation of FACS in fuzziness of normed structure of FACS by the construction a fuzzy normed cycle space of FACS that will be presented in this paper. In fact, a notion of a fuzzy norm in a fuzzy graph theory setting is established and interpreted the catalytic chain reaction between two cycles in this structure of FACS and employed in the incineration process that have different catalytic chain reaction because of its fuzzy norm structure. In addition, some important results would be proven involving convergence, Cauchyness and completeness of this structure of FACS. Preliminaries: Some of the basic concepts and results that included definitions and theorems pertaining to this research are introduced. The theoretical foundations of FACS are also presented.a directed graph is a certain trends of a (undirected) graph which the lines (edges) are labeled from points (vertices) to other as shown in Figure 2. Henceforward, this kind of graph will be studied throughout this study. (a) (b) Fig. 2:Examples of Graphs. (a) Directed (b) Undirected A directed graph is introduced by a relation on a set where denotes the set of vertices and denotes the set of its edges (Epp, 1993). A directed graph is also called a crisp graph if all the values of edges are 1 or 0 and it is called a fuzzy graph if its values is between 0 and 1. In other words, a fuzzy graph is with a vertex set as the underlying set with a pair of functions such that and is a fuzzy relation on with for all and denotes the minimum of and (Rosenfeld, 1975). A path :,,,...,, from a vertex to a vertex in a fuzzy graph if its sequence of distinct vertices and edges starting from and ending at such that the membership value for. If and coincide in a path then we call as a cycle. Note that the underlying crisp graph of the fuzzy graph is referred to.

3 14 UmilkeramQasimObaid and Tahir Ahmad, 2017 Moreover, Blue et al. (1997; 2002) have given five interpretations of the fuzziness of graph that led to study the choice of one of its type to best describe the model of incineration process. Thereby, Tahir et al. (2010) found that Type-3 is to be the most convenient for the assignment of improving the model of the process as explained in (Sabariahet al., 2009). The Type-3 of fuzzy graph is defined as having crisp vertices and edges with fuzzy edge connectivity of the edges i.e. the edge has fuzzy head and tail. With this consideration, the following definition was adopted in obtaining the fuzzy graph representing the clinical incineration process. The formal definition of FACS is given as follows: Fuzzy autocatalytic set (FACS) is a subgraph where each of whose nodes has at least one incoming link with membership value (Tahir et al., 2010). Aforementioned, Figure 1 is a fuzzy graphical for the modelof the incineration process with 6 variables (namely waste ( ), fuel ( ), oxygen ( ), carbon dioxide ( ), carbon monoxide ( ), and other gases including water ( )) and 15 edges which based on the catalytic relationship between the variables. Thus, is the set of vertices and is the set of edges where for and. Hence, fifteen edges are the connection between these variables in the process and the membership values of each fuzzy connectivity of edge are given as follows:,,,,,,,,,,,,,., In this context, a cycle in a fuzzy graph is a directed closed path of its vertices such that each edge and each vertex (except starting point) is visited only once. Then, FACS of fuzzy graph Type-3 particularly on the structures of normed spaces and its relations to cycles in FACS has been studied by Umilkeram and Tahir (2016). Several new notions namely FT3-fuzzy detour cycles of FACS, a FT3-cycle space of FACS as a vector space, and normed space of FACS of fuzzy graph Type-3 were presented as follows. Definition 1: Let be a FACS of fuzzy graph Type-3. The FT3-cycle is a closed path of distinct vertices,,..., (except = ) such that the membership value,, for each fuzzy edge connectivity of FACS and n is the number of edges in this cycle. The length of FT3-cycle in FACS is calculated by = such that each edge in this cycle is traversed in the right direction (see Figure 3). Definition 2: Let n be the number of all edges in the FT3-cycle containing an edge in FACS. A length of FT3-cycle containing the edge with n, denoted by, in FACS of fuzzy graph Type-3 is defined as the maximum length of any FT3-cycle that goes through the edge with the number of all edges in these FT3-cycles is the same and equal to n. A FT3-cycle containing the edge of length is called FT3-fuzzy detour cycle such that. Fig. 3: FT3-fuzzy detour cycle in FACS

4 15 UmilkeramQasimObaid and Tahir Ahmad, 2017 Definition 3: For a graph, let denote the set of all FT3-fuzzy detour cycles and edge-disjoint unions of these cycles in FACS, and an empty graph which means all vertices separate from each other. Then, is called the FT3-cycle space of. Thereafter,Umilkeram and Tahir (2016) proved that under the sum operation and multiplicationoperation (see Theorem 1) forms a vector space over {0, 1} (with addition and multiplication modulo 2), where the vector addition and the scalar multiplication are given by (1) and for each, (2) Theorem 1: The FT3-cycle space of,, is a vector space over {0, 1} (with addition and multiplication modulo 2). Then, the normed space of FACSwas constructed using the notion of the FT3-cycle space of FACS as a vector space over together with the following norm. = max (3) This shows that the concept of the norm of a vector in the FT3-cycle space of, is a generalization of the concept of length in. In other words, a FT3-cycle space of forms a normed space with the function as presented by Eq. (3). Then, a new type of normed space (see Theorem 2) which is the normed space of FACS of fuzzy graph Type-3 was presented. Theorem 2: Let be a FT3-cycle space of over and = max be a real-valued function on. Then, is a normed space. Furthermore, the basic FT3-fuzzy detour cycles for each edge in FACS of the incineration processwith respect to this norm are determined in this process represented by the FT3-cycle space associated with a graph of FACS of the incineration process. Consequently, the basic FT3-fuzzy detour cycles with respect to the norm as presented in Eq. (3) when interpret physically means that each fuzzy connectivity of edge in a FT3-fuzzy detour cycle has a certain proportion of the chemical interaction with other edges to the greatest extent norm. Now, we look at the idea of fuzzy norm on a FT3-cycle space of and its relation with the crisp norm which is presented in Theorem 2. The novelty of this notion is the incorporation of a couple important definitions in our work that are fuzzy graph represented by FACS of fuzzy graph Type-3 and fuzziness of norm represented by fuzzy norm in our sense which is close to the adaptation of Bag and Samanta type (2013). However, the modern notion is defined in such a way that the corresponding metric fuzziness is fuzzy quasi (pseudo) FT3-metric of FACS as shown inumilkeram and Tahir (2014). RESULTS AND DISCUSSION Fuzzy Norm on a FT3-Cycle Space of FACS: In this section, a concept of fuzzy norm is given on a FT3-cycle space of which defined in Definition 3. It begins with taking a function defined on as given in Eq. (4), followed by discussion on its properties. We see how this equation can be specialized for the idea of fuzzy norm on a FT3-cycle space as follows. It is noted that the above function has the following properties given in the following remarks. Remark 1: It is clear that for all. Clearly, for all. The following statement is not satisfied that (for all if and only if ) for Eq. (4), due to the second condition of the norm of (see Theorem 2). i.e. if and only if the cycle and which means the number of all edges in this cycle is. This is a contradiction since. (4)

5 16 UmilkeramQasimObaid and Tahir Ahmad, 2017 if Evidently, for all and, if (i.e. if ). is nondecreasing function on. If and, then it is obvious that. Now,, then = = Hence, clearly,. If. In what follows, it could be also shown that idea of fuzzy norm on a FT3-cycle space as presented in Eq. (4) fulfills the main property of the in the following theorem. Theorem 3: Suppose is a FT3-cycle space of over and is a norm on. Then, defined in Eq. (4) satisfies the following relation: for all, and. Proof: The relation is proved as follows: If (1) with ; ; (2) (3) with ;, then it is easily verified the above relation. If (4) with, then by the function as presented in Eq. (4) and the fourth condition of the norm of, we have (5) Now, note that = = = = (6) since Hence, by Eq.(5) and Eq.(6), we have the relation and this concludes the proof. Thus, at this placement, combining these properties with known notions on fuzzy norm in functional analysis, especially Bag and Samanta type (2013), this brings to the notion of a fuzzy normed cycle space of FACS as given in the following. Definition 4: Let be a FT3-cycle space of over and be a norm on. Suppose is a fuzzy set defined by, Wheretis the number of all edges in the FT3-fuzzy detour cycle and a continuous t-norm is theusual multiplication for all and is satisfied the following properties, for all.

6 17 UmilkeramQasimObaid and Tahir Ahmad, for all, 2. for all, 3. for all,, 4. is a nondecreasing function on 5.,. Then, an ordered pair (, ) is said to be fuzzy normed cycle space of FACS and is called a fuzzy norm induced by a norm on, see Figure 4. all edges in the FT3-fuzzy detour cycle, where is the number of in FACS. and = max, where is the number of vertices is one of these FT3-fuzzy detour cycle in FACS. wheretis the number of all edges in the FT3-fuzzy detour cycle in FACS. If satisfies the mentioned conditions 1,2,3,4,5 in Definition 4 then isfuzzy norm induced by norm on FACS. Fig. 4: Graphical representation ofafuzzy norm induced by a norm on FACS It is to be noted here thata fuzzy norm on in the sense that relates the greatest extent norm to andtis the number of all edges in this cycle. Moreover, an important observation in Definition 4 that the function is considered as the degree of nearness

7 18 UmilkeramQasimObaid and Tahir Ahmad, 2017 between two cycles in. It means this function can be interpreted the catalytic chain reaction between two cycles infuzzy normed cycle space of FACS. Therefore, one can talk about a sequence of cycles in fuzzy normed cycle space of FACS and discuss the concepts of a convergent sequence and Cauchy sequence in (, ) in the following subsection. Convergence in Fuzzy Normed Cycle Space of FACS: Suppose that is FT3-fuzzy detour cycle in, then from Definition 4, has a fuzzy norm such that the cycle containing the edge with which is the number of all edges in this cycle. Then, take another cycle containing the edge with which is the number of all edges in this cycle and hence, has a fuzzy norm. Consequently, the degree of nearness between two cycles of the catalytic chain reaction between these cycles in a fuzzy normed cycle space of FACS (, ) is. Now, by the same argument, another cycle containing the edge with has a fuzzy norm, then the degree of nearness between two cycles of the catalytic chain reaction between these cycles in (, ) is. Continuing in this way, we obtain a sequence of FT3-fuzzy detour cycles in (, ) which related to a fixed cycle with a fuzzy norm as shown in Figure 5. Fig. 5: Graphical illustration of a sequence (, ) of FACS of FT3-fuzzy detour cycles in a fuzzy normed cycle space Without loss of generality, it can replace by means of due to each element in is its own negative (i.e. as usual writing, see Theorem 1). In other words, represents inverse of the sum operation of symmetric difference as given by Eq.(1) in the vector space of FT3-cycle space. Then, one can provide a notion of a convergent sequence of FT3-fuzzy detour cycles in (, ) as follows. Definition 5: Let (, ) be a fuzzy normed cycle space of FACS and is a fuzzy norm induced by a norm on. Then, a sequence of FT3-fuzzy detour cycles in converges to (i.e.

8 19 UmilkeramQasimObaid and Tahir Ahmad, 2017 ) if satisfying a condition that for all. One calls a convergent point ofa sequence, see Figure 5. The above definition can be illustrated with the values of a function for the sequence of the above cycles in which converges to other cycle. Thus, we could studythe degree of nearness between two cycles of the catalytic chain reaction between these cycles in a fuzzy normed cycle space of FACS. In other words, we could study the relationship between these FT3-fuzzy detour cycles in FACS by a notion of a convergent sequence for all cycles in. Theorem 4: The convergent point of a sequence is unique. Proof: Let and and assume that. Then, by Definition 5, and for all. Thus, we obtain (by ) (by condition 3of Definition 4) =. Then, by taking limit, imply that Thus,. By condition 2 of Definition 4, yield that and this is a contradiction. Therefore, and this complete the proof. Now, the notion of a Cauchy sequence can be given when we have many FT3-fuzzy detour cycles in and it is complicated to find the catalytic chain reaction between these cycles that related to a fixed cycle in (, ). Definition 6: Suppose (, ) is a fuzzy normed cycle space of FACS and is a fuzzy norm induced by a norm on. Then, a sequence of FT3-fuzzy detour cycles in is a Cauchy sequence if satisfying a condition that for all and (see Figure 6).

9 20 UmilkeramQasimObaid and Tahir Ahmad, Fig. 6: Graphical illustration of a Cauchy sequence space (, ) of FACS of FT3-fuzzy detour cycles in a fuzzy normed cycle Theorem 5: Let be a convergent sequence in a fuzzy normed cycle space of FACS (, ). Then, is also a Cauchy sequence. Proof: Since is a convergent sequence in (, ), then bydefinition 5, for all and is convergent point of a sequence. Thus, by ( ) and for all and, we obtain Now, it is clear that each subsequence of and by taking limit, imply that By condition 2 of Definition 4, yield that = converges to the same convergent point of a sequence for all and.. Hence, from Definition 6, is a Cauchy sequence in (, ). Common Characteristics of Fuzzy Norm and Norm on FT3-Cycle Space of FACS: Consider the FT3-cycle space over of FACS and the norm defined on by. Thus, from Theorem 2,

10 21 UmilkeramQasimObaid and Tahir Ahmad, 2017 (, ) is a normed space. Also, consider the fuzzy norm induced by a norm on and defined by, Thus, from Definition 4, (, ) is a fuzzy normed cycle space of FACS. In this section, some properties of the norm on a FT3-cycle space can be participated with the fuzzy norm. The question that comes to our mind is to know which of these characteristics can be generalized to this fuzzy norm. The following two theorems try to answer the question. Theorem 6: Let(, ) be a fuzzy normed cycle space of FACS and is a fuzzy norm deduced of the norm on. Then, is a Cauchy sequence in (, ) if and only if is a Cauchy sequence in (, ). Proof: Suppose is a Cauchy sequence ina normed space (, ). It means the sequence of FT3-fuzzy detour cycles in satisfies a condition, as usual, for all (7) Then, for all imply that. By taking limit, imply that Therefore, is a Cauchy sequence in (, ). = = 1 (by (7)) Conversely, let be a Cauchy sequence in (, ). Then, for all and. Thus, we have = 1. Hence, is a Cauchy sequence in (, ). Theorem 7: Let (, ) be a fuzzy normed cycle space of FACS and is a fuzzy norm deduced of the norm on. Then, is a convergent sequence in (, ) if and only if is a convergent sequence in (, ). Proof: Let is a convergent sequence in (, ). From Definition 5, for all, imply that = 1 = 1 cycles in is converges to in a normed space (, ). in (, ). i.e. the sequence of FT3-fuzzy detour Thus, from previous two theorems, it is noticed that if there exists a normed space (, ) that is not complete, then a fuzzy normed cycle space of FACS (, ) is also not complete that the fuzzy norm induced by the crisp norm. Implementation: Implementation of Fuzzy Normed Cycles Space of FACS to Clinical Incineration Process: The idea of a fuzzy normed cycle space of FACS is used to give a fuzzy norm associated with a graph of FACS for the incineration process. Thus, it is easily verified that the function in Eq. (4) is satisfied the five conditions in Definition 4 with a graph of FACS for the incineration process.then, the fuzzy norm of each FT3-fuzzy detour cycle in Figure 3 with respect to t which is the number of all edges in this cycle is computed as follows.

11 22 UmilkeramQasimObaid and Tahir Ahmad, The FT3-fuzzy detour cyclethat contained the edge is with norm, then 2. The FT3-fuzzy detour cyclethat contained the edge is with norm 3. The FT3-fuzzy detour cycle that contained the edge is withnorm 4. The FT3-fuzzy detour cycle that contained the edge is with norm 5. The FT3-fuzzy detour cycle that contained the edge is with norm 6. The FT3-fuzzy detour cycle that contained the edge is with norm 7. The FT3-fuzzy detour cycle that contained the edge is with norm, then 8. The FT3-fuzzy detour cycle that contained the edge is with norm 9. The FT3-fuzzy detour cycle that contained the edge is with norm 10. The FT3-fuzzy detour cycle that contained the edge is with norm 11. The FT3-fuzzy detour cycle that contained the edge is with norm 12. The FT3-fuzzy detour cycle that contained the edge is with norm 13. The FT3-fuzzy detour cycles that contained the edge is with norm, then 14. The FT3-fuzzy detour cycles that contained the edge is with norm, then 15. The FT3-fuzzy detour cycles that contained the edge is with norm, then Thus, each FT3-fuzzy detour cycle in fuzzy normed cycle space of FACS for the incineration process have different catalytic chain reaction because of its fuzzy norm structure. Besides that, a chain reaction means here a chemical reaction in which the products themselves causes additional reactions to take place and enhance the reaction which under specific conditions may quicken. However, the function is considered as the degree of nearness between two cycles of the catalytic chain of chemical reaction between these cycles in fuzzy normed cycle space of FACS for the incineration process as explained in the following subsection. It was shown in Umilkeram and Tahir (2016) that the basic FT3-fuzzy detour cycles with respect to the norm given in Eq. (3) are ten cycles due to the fact that and Then, we attempt to explain the function as the catalytic chain reaction between two cycles in fuzzy normed cycle space of FACS for the incineration process in the following details. From third condition in Definition 4, note that for all,,. Then, we consider a FT3- fuzzy detour cycle that contained the edge with which is the number of all edges in this cycle and observe that and

12 23 UmilkeramQasimObaid and Tahir Ahmad, 2017 =. and =. Thus, the catalytic chain of chemical reaction between two cycles is more nearness between two cycles among other cycles that associated to and which is equal to =. Now, by the same argument, one can take another cycle that contained the edge with which is the number of all edges in this cycle and hence, has a fuzzy norm. Consequently, the degree of nearness between two cycles of the catalytic chain reaction between these cycles in a fuzzy normed cycle space of FACS is and is computed as bellow. Thus, the catalytic chain of chemical reaction between two cycles is more nearness between two cycles among other cycles that associated to and which is equal to =. Now, by taking another cycle that contained the edge with which is the number of all edges in this cycle and hence, has a fuzzy norm. Then, the degree of nearness between two cycles of the catalytic chain reaction between these cycles in a fuzzy normed cycle space of FACS is and is computed as bellow.

13 24 UmilkeramQasimObaid and Tahir Ahmad, 2017 Thus, the catalytic chain of chemical reaction between two cycles is more nearness between two cycles among other cycles that associated to and which is equal to =. Continuing in this way, we obtain a sequence of the degree of nearness between two cycles of the catalytic chain reaction between these cycles in a fuzzy normed cycle space of FACSfor the incineration process. Conclusion: In this paper, we introduce a notion of a fuzzy norm in a graph theory setting, namely, a fuzzy normed cycle space of FACS. Indeed, constructing fuzzy norm based on the FT3-cycle space of FACS is established and interpreted the catalytic chain reaction between two cycles in thisspace. Consequently, each FT3-fuzzy detour cycle in fuzzy normed cycle space of FACS for the incineration process have different catalytic chain reaction because of its fuzzy norm structure.in addition, some important results have been proven involving convergence, Cauchyness and completeness of the fuzzy normed cycle space of FACS. REFERENCES Blue, M., B. Bush and J. Puckett, Applications of Fuzzy Logic to Graph Theory. Los Alamos National Laboratory, LA-UR Blue, M., B. Bush, and J. Puckett, Unified Approach to Fuzzy Graph Problems. Fuzzy Sets and Systems, 125(3): Epp, S.S., Discrete Mathematics with Applications. Boston: PWS Publishing Company. Jain, S. and S. Krishna, Autocatalytic Sets and Growth of Complexity in an Evolutionary Model. Physical Review Letters, 81(25): Jain, S. and S. Krishna, Graph Theory and the Evolution of Autocatalytic Networks. In: Handbook of Graphs and Networks. Bornholdt, S. and H. G. Schuster (Eds.). Berlin: John Wily and VCH Publishers, pp: Rosenfeld, A., Fuzzy Graphs. In: Fuzzy Sets and Their Applications to Cognitive and Decision Processes. Zadeh, L. A., K.S. Fu and M. Shimura (Eds.). New York: Academic Press. Sabariah, B., Thinking Mathematical: Modeling of a Clinical Waste Incineration Process using Novel Fuzzy Autocatalytic Set, PhD. Thesis, UniversitiTeknologi Malaysia-Johore, Malaysia. Sabariah, B., A. Tahir, and M. Rashid, Relationship between Fuzzy Edge Connectivity and the Variables in Clinical Waste Incineration Process. MATEMATIKA, 25(1): Tahir, A., B. Sabariah and A.A. Khairil, Modeling a Clinical Incineration Process Using Fuzzy Autocatalytic Set. Journal of Mathematical Chemistry, 47(4): Umilkeram, Q.O. and A. Tahir, Fuzzy quasi-metric spaces of Fuzzy Autocatalytic Set (FACS) of fuzzy graph Type-3. Life Science Journal, 11(9): Umilkeram, Q.O. and A. Tahir, Novel Structures of Normed Spaces with Fuzzy Autocatalytic Set (FACS) of FuzzyGraph Type-3. Research Journal of Applied Sciences, Engineering and Technology, 12(5): Zadeh, L.A., Fuzzy sets. Information and Control, 8:

On Soft Topological Linear Spaces

On Soft Topological Linear Spaces Republic of Iraq Ministry of Higher Education and Scientific Research University of AL-Qadisiyah College of Computer Science and Formation Technology Department of Mathematics On Soft Topological Linear

More information

Some Types of Regularity and Normality Axioms in ech Fuzzy Soft Closure Spaces

Some Types of Regularity and Normality Axioms in ech Fuzzy Soft Closure Spaces http://wwwnewtheoryorg ISSN: 2149-1402 Received: 21062018 Published: 22092018 Year: 2018, Number: 24, Pages: 73-87 Original Article Some Types of Regularity and Normality Axioms in ech Fuzzy Soft Closure

More information

Effect of Regularization on Fuzzy Graph

Effect of Regularization on Fuzzy Graph International Journal of Applied Science-Research and Review (IJAS) www.ijas.org.uk Effect of Regularization on Fuzzy raph Vandana Bansal* IK PT University, Jalandhar, Punjab India Original Article A R

More information

Irregular Bipolar Fuzzy Graphs

Irregular Bipolar Fuzzy Graphs Inernational Journal of pplications of Fuzzy Sets (ISSN 4-40) Vol ( 0), 9-0 Irregular ipolar Fuzzy Graphs Sovan Samanta ssamantavu@gmailcom Madhumangal Pal mmpalvu@gmailcom Department of pplied Mathematics

More information

RESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES

RESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES ISSN 2320-9143 1 International Journal of Advance Research, IJOAR.org Volume 4, Issue 3, March 2016, Online: ISSN 2320-9143 RESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES A. Sreedevi, Dr.N.Ravi Shankar

More information

Definition 2.3: [5] Let, and, be two simple graphs. Then the composition of graphs. and is denoted by,

Definition 2.3: [5] Let, and, be two simple graphs. Then the composition of graphs. and is denoted by, International Journal of Pure Applied Mathematics Volume 119 No. 14 2018, 891-898 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu ON M-POLAR INTUITIONISTIC FUZZY GRAPHS K. Sankar 1,

More information

FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH

FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH International Journal of Information Technology and Knowledge Management July-December 2011 Volume 4 No 2 pp 495-499 FUZZY DOUBLE DOMINATION NUMBER AND CHROMATIC NUMBER OF A FUZZY GRAPH G MAHADEVAN 1 V

More information

(i, j)-almost Continuity and (i, j)-weakly Continuity in Fuzzy Bitopological Spaces

(i, j)-almost Continuity and (i, j)-weakly Continuity in Fuzzy Bitopological Spaces International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 2, February 2016, PP 89-98 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org (i, j)-almost

More information

Efficient Domination number and Chromatic number of a Fuzzy Graph

Efficient Domination number and Chromatic number of a Fuzzy Graph Efficient Domination number and Chromatic number of a Fuzzy Graph Dr.S.Vimala 1 J.S.Sathya 2 Assistant Professor,Department of Mathematics,Mother Teresa Women s University, Kodaikanal, India Research Scholar,

More information

Strong Chromatic Number of Fuzzy Graphs

Strong Chromatic Number of Fuzzy Graphs Annals of Pure and Applied Mathematics Vol. 7, No. 2, 2014, 52-60 ISSN: 2279-087X (P), 2279-0888(online) Published on 18 September 2014 www.researchmathsci.org Annals of Strong Chromatic Number of Fuzzy

More information

Metric Dimension in Fuzzy Graphs. A Novel Approach

Metric Dimension in Fuzzy Graphs. A Novel Approach Applied Mathematical Sciences, Vol. 6, 2012, no. 106, 5273-5283 Metric Dimension in Fuzzy Graphs A Novel Approach B. Praba 1, P. Venugopal 1 and * N. Padmapriya 1 1 Department of Mathematics SSN College

More information

International Journal of Mathematical Archive-5(9), 2014, Available online through ISSN

International Journal of Mathematical Archive-5(9), 2014, Available online through   ISSN International Journal of Mathematical Archive-5(9), 2014, 100-112 Available online through wwwijmainfo ISSN 2229 5046 ON D RULAR FUZZY RAPHS K Radha 1 and N Kumaravel 2 1 P Department of Mathematics, Periyar

More information

Disjunctive and Conjunctive Normal Forms in Fuzzy Logic

Disjunctive and Conjunctive Normal Forms in Fuzzy Logic Disjunctive and Conjunctive Normal Forms in Fuzzy Logic K. Maes, B. De Baets and J. Fodor 2 Department of Applied Mathematics, Biometrics and Process Control Ghent University, Coupure links 653, B-9 Gent,

More information

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY

A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,

More information

Bipolar Intuitionistic Fuzzy Graphs with Applications

Bipolar Intuitionistic Fuzzy Graphs with Applications Bipolar Intuitionistic Fuzzy Graphs with Applications K. Sankar 1, D. Ezhilmaran 2 1 Department of Mathematics, C. Abdul Hakeem College of Engineering & Technology, Melvisharam, Vellore, Tamilnadu, India.

More information

Bipolar Fuzzy Line Graph of a Bipolar Fuzzy Hypergraph

Bipolar Fuzzy Line Graph of a Bipolar Fuzzy Hypergraph BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 1 Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0002 Bipolar Fuzzy Line Graph of a

More information

Irregular Interval Valued Fuzzy Graphs

Irregular Interval Valued Fuzzy Graphs nnals of Pure and pplied Mathematics Vol 3, No, 03, 56-66 ISSN: 79-087X (P), 79-0888(online) Published on 0 May 03 wwwresearchmathsciorg nnals of Irregular Interval Valued Fuzzy Graphs Madhumangal Pal

More information

A comment on FUZZY GRAHPS ON COMPOSITION, TENSOR AND NORMAL PRODUCTS

A comment on FUZZY GRAHPS ON COMPOSITION, TENSOR AND NORMAL PRODUCTS 256 A comment on FUZZY GRAHPS ON COMPOSITION, TENSOR AND NORMAL PRODUCTS M. Rostamy-Malkhalifeh a, F. Falahati-Nezhad b, H.Saleh c1 a Department of Mathematics, Science and Research Branch, Islamic Azad

More information

Treewidth and graph minors

Treewidth and graph minors Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under

More information

Operations in Fuzzy Labeling Graph through Matching and Complete Matching

Operations in Fuzzy Labeling Graph through Matching and Complete Matching Operations in Fuzzy Labeling Graph through Matching and Complete Matching S. Yahya Mohamad 1 and S.Suganthi 2 1 PG & Research Department of Mathematics, Government Arts College, Trichy 620 022, Tamilnadu,

More information

Symmetric Product Graphs

Symmetric Product Graphs Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-20-2015 Symmetric Product Graphs Evan Witz Follow this and additional works at: http://scholarworks.rit.edu/theses

More information

On expansive chaotic maps in G-spaces

On expansive chaotic maps in G-spaces International Journal of Applied Mathematical Research, 3 (3) (2014) 225-232 Science Publishing Corporation wwwsciencepubcocom/indexphp/ijamr doi: 1014419/ijamrv3i32286 Research Paper On expansive chaotic

More information

Generalized Finite Sequence of Fuzzy Topographic Topological Mapping

Generalized Finite Sequence of Fuzzy Topographic Topological Mapping Journal of Mathematics and Statistics 6 (2): 151-156, 2010 ISSN 1549-3644 2010 Science Publications Generalized Finite Sequence of Fuzzy Topographic Topological Mapping 1,2 Tahir Ahmad, 2 Siti Suhana Jamian

More information

Hamiltonian Fuzzy Cycles on K 2n+1 Fuzzy Graph

Hamiltonian Fuzzy Cycles on K 2n+1 Fuzzy Graph International Journal of Scientific and Research Publications, Volume 2, Issue, November 202 ISSN 2250-353 Hamiltonian Fuzzy Cycles on K 2n+ Fuzzy raph DrNirmala *, MVijaya ** * Associate Professor, P

More information

M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements.

M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements. M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements. Chapter 1: Metric spaces and convergence. (1.1) Recall the standard distance function

More information

Reichenbach Fuzzy Set of Transitivity

Reichenbach Fuzzy Set of Transitivity Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 9, Issue 1 (June 2014), pp. 295-310 Applications and Applied Mathematics: An International Journal (AAM) Reichenbach Fuzzy Set of

More information

International Journal of Pure and Applied Sciences and Technology

International Journal of Pure and Applied Sciences and Technology Int. J. Pure Appl. Sci. Technol., 2(2) (2011), pp. 66-74 International Journal of Pure and Applied Sciences and Technology ISSN 2229-6107 Available online at www.ijopaasat.in Research Paper Fuzzy Soft

More information

Chapter 4. square sum graphs. 4.1 Introduction

Chapter 4. square sum graphs. 4.1 Introduction Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations

More information

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

More information

Assignment 4 Solutions of graph problems

Assignment 4 Solutions of graph problems Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of

More information

Independent Domination Number and Chromatic Number of a Fuzzy Graph

Independent Domination Number and Chromatic Number of a Fuzzy Graph International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 6, June 2014, PP 572-578 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Independent

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

More information

A Reduction of Conway s Thrackle Conjecture

A Reduction of Conway s Thrackle Conjecture A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854

More information

Greedy Algorithms 1 {K(S) K(S) C} For large values of d, brute force search is not feasible because there are 2 d {1,..., d}.

Greedy Algorithms 1 {K(S) K(S) C} For large values of d, brute force search is not feasible because there are 2 d {1,..., d}. Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,

More information

Evolution Module. 6.1 Phylogenetic Trees. Bob Gardner and Lev Yampolski. Integrated Biology and Discrete Math (IBMS 1300)

Evolution Module. 6.1 Phylogenetic Trees. Bob Gardner and Lev Yampolski. Integrated Biology and Discrete Math (IBMS 1300) Evolution Module 6.1 Phylogenetic Trees Bob Gardner and Lev Yampolski Integrated Biology and Discrete Math (IBMS 1300) Fall 2008 1 INDUCTION Note. The natural numbers N is the familiar set N = {1, 2, 3,...}.

More information

Topology Homework 3. Section Section 3.3. Samuel Otten

Topology Homework 3. Section Section 3.3. Samuel Otten Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that

More information

FUZZY GRAPH OF SEMIGROUP

FUZZY GRAPH OF SEMIGROUP BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 wwwimviblorg /JOURNALS / BULLETIN Vol 8(2018), 439-448 DOI: 107251/BIMVI1803439R Former BULLETIN OF THE

More information

General properties of staircase and convex dual feasible functions

General properties of staircase and convex dual feasible functions General properties of staircase and convex dual feasible functions JÜRGEN RIETZ, CLÁUDIO ALVES, J. M. VALÉRIO de CARVALHO Centro de Investigação Algoritmi da Universidade do Minho, Escola de Engenharia

More information

On Fuzzy Topological Spaces Involving Boolean Algebraic Structures

On Fuzzy Topological Spaces Involving Boolean Algebraic Structures Journal of mathematics and computer Science 15 (2015) 252-260 On Fuzzy Topological Spaces Involving Boolean Algebraic Structures P.K. Sharma Post Graduate Department of Mathematics, D.A.V. College, Jalandhar

More information

REDUNDANCY OF MULTISET TOPOLOGICAL SPACES

REDUNDANCY OF MULTISET TOPOLOGICAL SPACES Iranian Journal of Fuzzy Systems Vol. 14, No. 4, (2017) pp. 163-168 163 REDUNDANCY OF MULTISET TOPOLOGICAL SPACES A. GHAREEB Abstract. In this paper, we show the redundancies of multiset topological spaces.

More information

Independence Number and Cut-Vertices

Independence Number and Cut-Vertices Independence Number and Cut-Vertices Ryan Pepper University of Houston Downtown, Houston, Texas 7700 pepperr@uhd.edu Abstract We show that for any connected graph G, α(g) C(G) +1, where α(g) is the independence

More information

The Game Chromatic Number of Some Classes of Graphs

The Game Chromatic Number of Some Classes of Graphs The Game Chromatic Number of Some Classes of Graphs Casper Joseph Destacamento 1, Andre Dominic Rodriguez 1 and Leonor Aquino-Ruivivar 1,* 1 Mathematics Department, De La Salle University *leonorruivivar@dlsueduph

More information

Algebraic Structure Of Union Of Fuzzy Sub- Trigroups And Fuzzy Sub Ngroups

Algebraic Structure Of Union Of Fuzzy Sub- Trigroups And Fuzzy Sub Ngroups Algebraic Structure Of Union Of Fuzzy Sub- Trigroups And Fuzzy Sub Ngroups N. Duraimanickam, N. Deepica Assistant Professor of Mathematics, S.T.E.T Women s College, Mannargudi, Tamilnadu. India-Pin-614016

More information

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free

More information

AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP

AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP AN ALGORITHM WHICH GENERATES THE HAMILTONIAN CIRCUITS OF A CUBIC PLANAR MAP W. L. PRICE ABSTRACT The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map

More information

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks

More information

ON STRONGLY EDGE IRREGULAR FUZZY GRAPHS

ON STRONGLY EDGE IRREGULAR FUZZY GRAPHS Kragujevac Journal of Mathematics Volume 40(1) (2016), Pages 125 135. ON STRONGLY EDGE IRREGULAR FUZZY GRAPHS N. R. SANTHIMAHESWARI AND C. SEKAR Abstract. In this paper strongly edge irregular fuzzy graphs

More information

Throughout the chapter, we will assume that the reader is familiar with the basics of phylogenetic trees.

Throughout the chapter, we will assume that the reader is familiar with the basics of phylogenetic trees. Chapter 7 SUPERTREE ALGORITHMS FOR NESTED TAXA Philip Daniel and Charles Semple Abstract: Keywords: Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf sets

More information

Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube

Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long

More information

A digital pretopology and one of its quotients

A digital pretopology and one of its quotients Volume 39, 2012 Pages 13 25 http://topology.auburn.edu/tp/ A digital pretopology and one of its quotients by Josef Šlapal Electronically published on March 18, 2011 Topology Proceedings Web: http://topology.auburn.edu/tp/

More information

Rough Connected Topologized. Approximation Spaces

Rough Connected Topologized. Approximation Spaces International Journal o Mathematical Analysis Vol. 8 04 no. 53 69-68 HIARI Ltd www.m-hikari.com http://dx.doi.org/0.988/ijma.04.4038 Rough Connected Topologized Approximation Spaces M. J. Iqelan Department

More information

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006

2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,

More information

FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO

FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO J. Appl. Math. & Computing Vol. 16(2004), No. 1-2, pp. 371-381 FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO Abstract. In this paper, fuzzy metric spaces are redefined, different from the previous

More information

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus) Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.

More information

Sharp lower bound for the total number of matchings of graphs with given number of cut edges

Sharp lower bound for the total number of matchings of graphs with given number of cut edges South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut

More information

Perfect Dominating Sets in Fuzzy Graphs

Perfect Dominating Sets in Fuzzy Graphs IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, Volume 8, Issue 3 (Sep. - Oct. 2013), PP 43-47 Perfect Dominating Sets in Fuzzy Graphs S. Revathi, P.J.Jayalakshmi, C.V.R.Harinarayanan

More information

On the null space of a Colin de Verdière matrix

On the null space of a Colin de Verdière matrix On the null space of a Colin de Verdière matrix László Lovász 1 and Alexander Schrijver 2 Dedicated to the memory of François Jaeger Abstract. Let G = (V, E) be a 3-connected planar graph, with V = {1,...,

More information

MA651 Topology. Lecture 4. Topological spaces 2

MA651 Topology. Lecture 4. Topological spaces 2 MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter

More information

International Journal of Scientific & Engineering Research, Volume 7, Issue 2, February ISSN

International Journal of Scientific & Engineering Research, Volume 7, Issue 2, February ISSN International Journal of Scientific & Engineering Research, Volume 7, Issue 2, February-2016 149 KEY PROPERTIES OF HESITANT FUZZY SOFT TOPOLOGICAL SPACES ASREEDEVI, DRNRAVI SHANKAR Abstract In this paper,

More information

Generalized Implicative Model of a Fuzzy Rule Base and its Properties

Generalized Implicative Model of a Fuzzy Rule Base and its Properties University of Ostrava Institute for Research and Applications of Fuzzy Modeling Generalized Implicative Model of a Fuzzy Rule Base and its Properties Martina Daňková Research report No. 55 2 Submitted/to

More information

STRONGLY REGULAR FUZZY GRAPH

STRONGLY REGULAR FUZZY GRAPH 345 STRONGLY REGULAR FUZZY GRAPH K. Radha 1 * and A.Rosemine 2 1 PG and Research Department of Mathematics,Periyar E.V.R. College, Tiruchirappalli 620023 Tamilnadu, India radhagac@yahoo.com 2 PG and Research

More information

Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1

Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture

More information

Lecture 20 : Trees DRAFT

Lecture 20 : Trees DRAFT CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,

More information

Neighborhood and Efficient Triple Connected Domination Number of a Fuzzy Graph

Neighborhood and Efficient Triple Connected Domination Number of a Fuzzy Graph Intern. J. Fuzzy Mathematical Archive Vol. 9, No. 1, 2015, 73-80 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 8 October 2015 www.researchmathsci.org International Journal of Neighborhood and Efficient

More information

Uniform edge-c-colorings of the Archimedean Tilings

Uniform edge-c-colorings of the Archimedean Tilings Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:

More information

Theorem 2.9: nearest addition algorithm

Theorem 2.9: nearest addition algorithm There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

More information

On Sequential Topogenic Graphs

On Sequential Topogenic Graphs Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 36, 1799-1805 On Sequential Topogenic Graphs Bindhu K. Thomas, K. A. Germina and Jisha Elizabath Joy Research Center & PG Department of Mathematics Mary

More information

Line Graphs and Circulants

Line Graphs and Circulants Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),

More information

Some Domination Parameters of Arithmetic Graph Vn

Some Domination Parameters of Arithmetic Graph Vn IOSR Journal of Mathematics (IOSRJM) ISSN: 78-578 Volume, Issue 6 (Sep-Oct. 0), PP 4-8 Some Domination Parameters of Arithmetic Graph Vn S.Uma Maheswari and B.Maheswari.Lecturer in Mathematics, J.M.J.College,

More information

AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION

AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE 1.INTRODUCTION Mathematical and Computational Applications, Vol. 16, No. 3, pp. 588-597, 2011. Association for Scientific Research AN APPROXIMATION APPROACH FOR RANKING FUZZY NUMBERS BASED ON WEIGHTED INTERVAL - VALUE

More information

TRANSITIVE GRAPHS UNIQUELY DETERMINED BY THEIR LOCAL STRUCTURE

TRANSITIVE GRAPHS UNIQUELY DETERMINED BY THEIR LOCAL STRUCTURE TRANSITIVE GRAPHS UNIQUELY DETERMINED BY THEIR LOCAL STRUCTURE JOSHUA FRISCH AND OMER TAMUZ Abstract. We give an example of an infinite, vertex transitive graph that has the following property: it is the

More information

Trees and Tree Encodings

Trees and Tree Encodings Trees and Tree Encodings January, 08 Introduction: Today, we are going to be looking at a special class of graph theory called trees. These structures are an important discipline in mathematics and have

More information

The Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph

The Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005

More information

Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

More information

On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order

On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order Pavel Martinek Department of Computer Science, Palacky University, Olomouc Tomkova 40, CZ-779 00 Olomouc, Czech Republic

More information

CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN

CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.

More information

Total Semi - µ Strong (Weak) Domination in Intuitionistic Fuzzy Graph

Total Semi - µ Strong (Weak) Domination in Intuitionistic Fuzzy Graph IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 5 Ver. V (Sep. - Oct.2016), PP 37-43 www.iosrjournals.org Total Semi - µ Strong (Weak) Domination in Intuitionistic

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information

Best proximation of fuzzy real numbers

Best proximation of fuzzy real numbers 214 (214) 1-6 Available online at www.ispacs.com/jfsva Volume 214, Year 214 Article ID jfsva-23, 6 Pages doi:1.5899/214/jfsva-23 Research Article Best proximation of fuzzy real numbers Z. Rohani 1, H.

More information

On Generalizing Rough Set Theory

On Generalizing Rough Set Theory On Generalizing Rough Set Theory Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Abstract. This paper summarizes various formulations

More information

Basics of Graph Theory

Basics of Graph Theory Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their

More information

Star Decompositions of the Complete Split Graph

Star Decompositions of the Complete Split Graph University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses

More information

Definition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.

Definition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees. Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G

More information

The Geodesic Integral on Medial Graphs

The Geodesic Integral on Medial Graphs The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection

More information

Introduction to Graphs

Introduction to Graphs Graphs Introduction to Graphs Graph Terminology Directed Graphs Special Graphs Graph Coloring Representing Graphs Connected Graphs Connected Component Reading (Epp s textbook) 10.1-10.3 1 Introduction

More information

International Journal of Scientific & Engineering Research, Volume 6, Issue 2, February-2015 ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 2, February-2015 ISSN ISSN 2229-5518 1692 Application of Fuzzy Graph in Traffic R.yna, Abstract In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type

More information

Vertex 3-colorability of claw-free graphs

Vertex 3-colorability of claw-free graphs Algorithmic Operations Research Vol.2 (27) 5 2 Vertex 3-colorability of claw-free graphs Marcin Kamiński a Vadim Lozin a a RUTCOR - Rutgers University Center for Operations Research, 64 Bartholomew Road,

More information

Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks

Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1

More information

A PRIME FACTOR THEOREM FOR A GENERALIZED DIRECT PRODUCT

A PRIME FACTOR THEOREM FOR A GENERALIZED DIRECT PRODUCT Discussiones Mathematicae Graph Theory 26 (2006 ) 135 140 A PRIME FACTOR THEOREM FOR A GENERALIZED DIRECT PRODUCT Wilfried Imrich Department of Mathematics and Information Technology Montanuniversität

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set

More information

Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm

Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm N. Shahsavari Pour Department of Industrial Engineering, Science and Research Branch, Islamic Azad University,

More information

RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF

RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF RAINBOW CONNECTION AND STRONG RAINBOW CONNECTION NUMBERS OF Srava Chrisdes Antoro Fakultas Ilmu Komputer, Universitas Gunadarma srava_chrisdes@staffgunadarmaacid Abstract A rainbow path in an edge coloring

More information

Greedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d

Greedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,

More information

CS 6783 (Applied Algorithms) Lecture 5

CS 6783 (Applied Algorithms) Lecture 5 CS 6783 (Applied Algorithms) Lecture 5 Antonina Kolokolova January 19, 2012 1 Minimum Spanning Trees An undirected graph G is a pair (V, E); V is a set (of vertices or nodes); E is a set of (undirected)

More information

Properly Colored Paths and Cycles in Complete Graphs

Properly Colored Paths and Cycles in Complete Graphs 011 ¼ 9 È È 15 ± 3 ¾ Sept., 011 Operations Research Transactions Vol.15 No.3 Properly Colored Paths and Cycles in Complete Graphs Wang Guanghui 1 ZHOU Shan Abstract Let K c n denote a complete graph on

More information

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions

A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions 1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =

More information

arxiv: v4 [math.co] 25 Apr 2010

arxiv: v4 [math.co] 25 Apr 2010 QUIVERS OF FINITE MUTATION TYPE AND SKEW-SYMMETRIC MATRICES arxiv:0905.3613v4 [math.co] 25 Apr 2010 AHMET I. SEVEN Abstract. Quivers of finite mutation type are certain directed graphs that first arised

More information

Some fixed fuzzy point results using Hausdorff metric in fuzzy metric spaces

Some fixed fuzzy point results using Hausdorff metric in fuzzy metric spaces Annals of Fuzzy Mathematics and Informatics Volume 13, No 5, (May 017), pp 641 650 ISSN: 093 9310 (print version) ISSN: 87 635 (electronic version) http://wwwafmiorkr @FMI c Kyung Moon Sa Co http://wwwkyungmooncom

More information

Complement Properties on Strong Fuzzy Graphs

Complement Properties on Strong Fuzzy Graphs International Journal of Scientific and Research Publications, Volume 5, Issue 3, March 2015 1 Complement Properties on Strong Fuzzy Graphs M.Vijaya Department of Mathematics, Marudupandiyar College, Thanjavur,

More information

Crown-free highly arc-transitive digraphs

Crown-free highly arc-transitive digraphs Crown-free highly arc-transitive digraphs Daniela Amato and John K Truss University of Leeds 1. Abstract We construct a family of infinite, non-locally finite highly arc-transitive digraphs which do not

More information