# Types of Degrees in Bipolar Fuzzy Graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 pplied Mathematical Sciences, Vol. 7, 2013, no. 98, HIKRI Ltd, Types of Degrees in Bipolar Fuzzy Graphs Basheer hamed Mohideen Department of Mathematics, Faculty of Science University of Tabuk, Saudi rabia Copyright 2013 Basheer hamed Mohideen. This is an open access article distributed under the Creative Commons ttribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. bstract bipolar fuzzy graph is a generalization of graph theory by using bipolar fuzzy sets. The bipolar fuzzy sets are an extension of fuzzy sets. This paper introduces an effective degree of a vertex, a (ordinary) degree of a vertex in bipolar fuzzy graph as analogous of fuzzy graph, a semiregular bipolar fuzzy graph, and a semicomplete bipolar fuzzy graph. Further, this paper gives some propositions. Mathematics Subject Classification: 03E72, 05C07 Keywords: Bipolar fuzzy graph, effective degree of a vertex, semiregular bipolar fuzzy graph, semicomplete bipolar fuzzy graph 1 Introduction The notion of fuzzy sets was introduced by Zadeh [12] as a way of representing uncertainty and vagueness. s a generalization of fuzzy sets, Zhang ([13, 14]) introduced the concept of bipolar fuzzy sets. bipolar fuzzy set has a pair of positive and negative membership values range is [-1, 1]. In a bipolar fuzzy set, the membership degree 0 of an element means that the element is irrelevant to the corresponding property, the membership value (0, 1] of an element indicates that the element somewhat satisfies the property, and the membership value [-1, 0) of an element indicates that the element somewhat satisfies the implicit counterproperty. In many domains, it is important to be able to deal with bipolar

2 4858 Basheer hamed Mohideen information. It is distinguished that positive information represents what is granted to be possible, while negative information represents what is considered to be impossible. It is quite well known that graphs are simply models of relations. graph is a convenient way of representing information involving relationship between objects. The objects are represented by vertices and relations by edges. When there is vagueness in the description of the objects or in its relationships or in both, it is natural that we need to assign a fuzzy graph model. Rosenfeld [11] discussed the concept of fuzzy graphs whose basic idea was introduced by Kauffmann [8]. The fuzzy relations between two fuzzy sets were also considered by Rosenfeld [11] and developed the structure of fuzzy graphs, obtained analogous of several graph theoretical concepts. Bhattacharya gave some remarks on fuzzy graphs in [5]. Bhutani and Rosenfeld [6] discussed strong arc in fuzzy graphs. The concept of closed neighborhood degree and its extension in fuzzy graphs was introduced by Basheer hamed et. al. [4]. The extension of fuzzy set theory, that is, bipolar fuzzy set theory gives more precision, flexibility, and compatibility to the system as compared to the classical and fuzzy models. Recently, kram [1] introduced bipolar fuzzy graphs by combining bipolar fuzzy set theory and graph theory. kram and Dudek [2] studied regular bipolar fuzzy graphs, and kram [3] also discussed bipolar fuzzy graphs with applications. In this paper, an effective degree of a vertex, a (ordinary) degree of a vertex in bipolar fuzzy graph as analogous of fuzzy graph, a semiregular bipolar fuzzy graph, and a semicomplete bipolar fuzzy graph are introduced. Finally, some propositions with suitable examples are examined. 2 Preliminaries In this section, some basic definitions and its related results are recalled. Definition 2.1 [12] Let V be a nonempty set. fuzzy subset of V is mapping µ: V [0, 1], where [0, 1] denotes the set {t R: 0 t 1}. Definition 2.2 [12] Let V and W be any two sets, and let µ and ν be fuzzy subsets of V and W, respectively. fuzzy relation ρ from the fuzzy subset µ into the fuzzy subset ν is a fuzzy subset of VxW such that ρ (v, w) µ(v) ν(w)for all v V, w W. That is, for ρ to be a fuzzy relation, we require that the degree of membership of a pair of elements never exceeds the degree of membership of either of the elements themselves. Note that a fuzzy relation on a finite and nonempty set V is a functionρ : V V [0, 1]; a fuzzy relation ρ is symmetric if ρ (v, w) = ρ (w, v) for all v, w V. Definition 2.3 ([13, 14]) Let X be a nonempty set. bipolar fuzzy (sub) set B in X is an object having the form {, P N B = x µ ( x), µ ( x) : x X } where P N µ : X [0,1] and µ : X [ 1, 0] are mappings.

3 Types of degrees in bipolar fuzzy graphs 4859 The positive membership degree is used to denote the satisfaction degree of an element x to the property corresponding to a bipolar fuzzy set B, and the negative membership degree µ N ( x) to denote the satisfaction degree of an element x to some implicit counter-property corresponding to a bipolar fuzzy set B. If µ P ( x) 0 and µ N ( x) = 0, it is the situation that x is regarded as having only positive satisfaction for B. If µ P ( x) = 0 and µ N ( x) 0, it is the situation that x does not satisfy the property of B but somewhat satisfies the counter property of B. It is possible for an element x to be such µ P ( x) 0 and µ N ( x) 0, when the membership function of the property overlaps that of its counter property over some portion of X. For the sake of simplicity, the symbol, is used for the bipolar fuzzy set {, P N B = x µ ( x), µ ( x) : x X }. Definition 2.4 ([13, 14]) Let X be a nonempty set. Then, we call a mapping P N = ( µ, µ ) : X X [ 1,1] [ 1,1] a bipolar fuzzy relation on X such that, 0,1 and, 1,0 t this juncture, let us recall some basic definitions in graph theory [7], a graph is an ordered pair G* = (V, E), where V is the nonempty set of vertices of G* and E is the set of edges of G*. Two vertices x and y in an undirected graph G* are said to be adjacent or neighbors in G* if {x,y} is an edge of G*. simple graph is an undirected graph that has no loops and/or no more than one edge between any two different vertices. The neighborhood of a vertex v in a graph G* is the induced subgraph of G* consisting of all vertices adjacent to v and all edges connecting two such vertices. The neighborhood is often denoted N(v). The degree deg(x) of vertex x (simply d(x)) is the number of edges incident on x or equivalently, deg(x) = N(x). The set of neighbors, called a (open) neighborhood N(x) for a vertex x in a graph G*, consists of all vertices adjacent to x but not including x, that is, :. When x is also included, it is called a closed neighborhood, denoted, that is,. regular graph is a graph where each vertex has the same number of neighbors, that is, all the vertices have the same open neighborhood degree. complete graph is a simple graph in which every pair of distinct vertices is connected by an edge. Let us recall some basic definitions in fuzzy graph theory [4, 9, 10], a fuzzy graph G = (V, µ, ρ) is a nonempty set V together with a pair of functions µ : V [0,1] and ρ : V V [0,1] such that ρ(x,y) µ(x) µ(y), for all x, y V, where µ(x) µ(y) denotes the minimum of µ(x) and µ(y). fuzzy graph G is called a strong fuzzy graph if ρ(x,y)=µ(x) µ(y), {x,y} VxV. fuzzy graph G is complete if ρ(x,y)=µ(x) µ(y), x, y V. Note that if ρ(x, y)>0 we call x and y neighbors and we say that x and y lie on {x, y}. The order and size of a fuzzy graph G are defined as and,,, respectively. n edge {x,y} of a fuzzy graph G is called an effective edge if,. :, is called the neighborhood of x, and is called the closed neighborhood

4 4860 Basheer hamed Mohideen of x. The degree of a vertex can be generalized in different ways for a fuzzy graph. The effective degree of a vertex x is defined as the sum of the membership value of the effective edges incident with x, and is denoted by d E (x). That is,,,. The neighborhood degree of a vertex is defined as the sum of the membership value of the neighborhood vertices of x, and is denoted by d N (x). Now, some definitions in bipolar fuzzy graph which can be found in [1-3] are summarized. Definition 2.5 bipolar fuzzy graph with an underlying set V is defined to be a P N P N pair G = (, B), where = ( µ, µ ) is a bipolar fuzzy set in V and B = ( µ, µ ) is a bipolar fuzzy set in E V V such that µ P ({ x, y}) min( µ P ( x), µ P ( y)) and B N N N µ B ({ x, y}) max( µ ( x), µ ( y)) for all { x, y} E. Here, the bipolar fuzzy vertex set of V and B the bipolar fuzzy edge set of E. Note that B is symmetric bipolar fuzzy relation on. We use notion xy for an element of E. Thus G = (, B) is a bipolar fuzzy graph of G* = ( V, E) if µ P ( xy) min( µ P ( x), µ P ( y)) and µ N ( xy) max( µ N ( x), µ N ( y)) for all xy E. B B The definition 2.5 can be written as, a bipolar fuzzy graph G = ( V, E, µ, ρ) where V is a nonempty vertex set, E V V is an edge set, µ is bipolar fuzzy set on V, P N and ρ is bipolar fuzzy set on E, that is, µ ( x) = ( µ ( x), µ ( x)), and ( ) ( P N ρ xy = ρ ( xy), ρ ( xy)) such that min, and min, for all x, y V and xy E. Here, xy means that {x,y}, an undirected edge. The notation,,, is used for bipolar fuzzy graph G, where V is nonempty vertex set, E is edge set, µ is fuzzy subset of V, and ρ is fuzzy subset of E. Definition 2.6 bipolar fuzzy graph G = ( V, E, µ, ρ) is said to be strong if P P P ρ ( xy) = min{ µ ( x), µ ( y)} and ρ N ( xy) = max{ µ N ( x), µ N ( y)} for all xy E. Definition 2.7 bipolar fuzzy graph G = ( V, E, µ, ρ) is said to be complete if P P P N N N ρ ( xy) = min{ µ ( x), µ ( y)} and ρ ( xy) = max{ µ ( x), µ ( y)} for all x, y V. Definition 2.8 Let G be a bipolar fuzzy graph. The neighborhood of a vertex x in G is defined by, where : min, and : max,. Definition 2.9 Let G be a bipolar fuzzy graph. The (open) neighborhood degree of a vertex x in G is defined by deg,, where and. B B

5 Types of degrees in bipolar fuzzy graphs 4861 Note: 0, 0 ; 0 Definition 2.10 Let G be a bipolar fuzzy graph. The closed neighborhood degree of a vertex x in G is defined by deg, where and. Definition 2.11 bipolar fuzzy graph G = ( V, E, µ, ρ) is said to be, regular if,, where. Hereafter, the neighborhood degree of a vertex v is denoted by and the closed neighborhood degree of a vertex v is denoted by. 3. Order and size in bipolar fuzzy graph In this section, the order of bipolar fuzzy graph, which is a pair of positive order and negative order of bipolar fuzzy graph and the size of bipolar fuzzy graph, which is a pair of positive size and negative size of bipolar fuzzy graph are presented. These ideas are analogous of order and size in fuzzy graph [10]. Definition 3.1 Let,,, be a bipolar fuzzy graph. The order of bipolar fuzzy graph, denoted, is defined as,, where ;. Similarly, the size of bipolar fuzzy graph, denoted, is defined as,, where ρ ; ρ. Proposition 3.2 In a bipolar fuzzy graph,,,, the following inequalities hold: (a) ; (b). Proof Let,,, be a bipolar fuzzy graph. By definition 3.1, we have. This implies. Similarly,. This implies. Example 3.3 Let,,, be a bipolar fuzzy graph, where,,,,,,,, with 0.7, 1, 0.6, 0.8, 0.8, 0.6, 0.4, 0.5 ; 0.6, 0.5, 0.3, 0.3, 0.5, 0.6, 0.4, 0.5, 0.4, 0.5. By usual calculations, we get, 2.5, 2.2. Similarly, 2.9, 2.4. Corollary 3.4 In a regular bipolar fuzzy graph, (a) ; (b).

6 4862 Basheer hamed Mohideen 4. Types of degrees in bipolar fuzzy graphs kram[3] introduced neighborhood degree of a vertex and closed neighborhood degree of a vertex in bipolar fuzzy graph as generalization of neighborhood degree and closed neighborhood degree of a vertex in fuzzy graph. This section introduces an effective degree of a vertex and a degree of a vertex in bipolar fuzzy graph as analogous of an effective degree and a degree of a vertex in fuzzy graph. lso, introduces a semiregular bipolar fuzzy graph and a semicomplete bipolar fuzzy graph. Further, some of their results are investigated. Definition 4.1 let,,, be a bipolar fuzzy graph. n edge is called effective if min, max, for all. It is denoted by,. The effective degree of a vertex v in bipolar fuzzy graph G, denoted by, is defined as,. Definition 4.2Let,,, be a bipolar fuzzy graph. The ordinary degree (simply degree)) of a vertex v in bipolar fuzzy graph G, denoted by, is defined as,. Example 4.3 Let,,, be a bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.6, 0.7, 0.8, 0.6 ; 0.5, 0.6, 0.4, 0.6, 0.6, 0.5. By usual calculations, 0.9, 1.2, 1.1, 1.1, 1.0, 1.1. Here is the only effective edge. The effective degrees are 0.5, 0.6, 0.5, 0.6, 0,0. Note: 0,0 means that there is no effective edge incident on. Definition 4.4 bipolar fuzzy graph,,, is said to be semiregular if all vertices have same closed neighborhood degrees. We say that G is, if,,,,, where is real number set. Example 4.5 Let,,, be a bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.6, 0.7, 0.8, 0.6 ; 0.5, 0.6, 0.4, 0.6, 0.6, 0.5. By usual calculations, the (open) neighborhood degrees are 1.4, 1.3, 1.3, 1.2, 1.1, 1.3. Therefore, it is not regular. But, 1.9, 1.9, 1.9, 1.9, 1.9, 1.9. It is a semiregular bipolar fuzzy graph. lso, it is known as 1.9, semiregular bipolar fuzzy graph.

7 Types of degrees in bipolar fuzzy graphs 4863 Definition 4.6 bipolar fuzzy graph,,, is said to be semicomplete if it satisfies complete (crisp) graph condition, but G does not satisfy strong bipolar fuzzy graph condition. Example 4.7 Let,,, be a bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.6, 0.7, 0.8, 0.6 ; 0.5, 0.6, 0.4, 0.6, 0.6, 0.5. Here, all vertices are joined together, but all edges are not strong. Hence, it is a semicomplete bipolar fuzzy graph. Proposition 4.8 In a strong bipolar fuzzy graph,,,, for all. Proof Let,,, be a strong bipolar fuzzy graph.by definition 4.2, we have, (1) Since G is strong bipolar fuzzy graph, all edges are strong edges, therefore the equation (1) can be written as,,, by definition 4.1. Example 4.9 Let,,, be a strong bipolar fuzzy graph, where,,,,,,,, with 0.7, 1, 0.6, 0.8, 0.8, 0.6, 0.4, 0.5 ; 0.6, 0.8, 0.4, 0.5, 0.6, 0.6, 0.4, 0.5, 0.4, 0.5. By usual computations, 0.9, 0.8, 1.5, 1.6, 0.9, 1.1, 1.1, 1.3 ; 0.9, 0.8, 1.5, 1.6, 0.9, 1.1, 1.1, 1.3. Thus,. Proposition 4.10 Every complete bipolar fuzzy graph is semiregular bipolar fuzzy graph. Proof Let,,, be a complete bipolar fuzzy graph. Since G is complete bipolar fuzzy graph, all edges are strong and all vertices are connected together. By the closed neighborhood degrees of all vertices, we have are equal for all. Hence, G is semiregular bipolar fuzzy graph. Note: Every complete bipolar fuzzy graph need not be regular bipolar fuzzy graph. Example 4.11 Let,,, be a complete bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.6, 0.7, 0.8, 0.6 ; 0.5, 0.6, 0.5, 0.6, 0.6, 0.6. By usual calculations, the (open) neighborhood degrees are 1.4, 1.3, 1.3, 1.2,

8 4864 Basheer hamed Mohideen 1.1, 1.3. Therefore, it is not regular. But, 1.9, 1.9, 1.9, 1.9, 1.9, 1.9. Thus, it is a semiregular bipolar fuzzy graph. lso, it is known as 1.9, semiregular bipolar fuzzy graph. Proposition 4.12 In any complete bipolar fuzzy graph,,,,,. That is, the closed neighborhood degree of any vertex is equal to the order of bipolar fuzzy graph. Proof Since G is complete bipolar fuzzy graph, it is easy to check that from proposition 4.10,,, =, for all. Proposition 4.13 In a regular bipolar fuzzy graph,,,, closed neighborhood degree, order of bipolar fuzzy graph and size of bipolar fuzzy graph are equal. Proof Since G is regular, the degrees of all vertices are same and also all vertices have same bipolar membership values and connected one another. By proposition 4.12, we have,. (2) By definition 3.1, we have, =,,. (3) From the equations (2) and (3), we get for all. Proposition 4.14 In a regular bipolar fuzzy graph,,,, ordinary degrees, effective degrees and neighborhood degrees are equal for any vertex in G. That is,,. Proof Since G is regular, we have, min,,,,...(4) By definition 2.9, definition 4.1, definition 4.2 inclined with equation (4), we get,. Example 4.15 Let,,, be a regular bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.5, 0.6, 0.5, 0.6 ; 0.5, 0.6, 0.5, 0.6, 0.5, 0.6. By usual calculations:the (ordinary) degrees are 1.0, 1.2, 1.0, 1.2, 1.0, 1.2. The

9 Types of degrees in bipolar fuzzy graphs 4865 effective degrees are 1.0, 1.2, 1.0, 1.2, 1.0, 1.2. The (open) neighborhood degrees are 1.0, 1.2, 1.0, 1.2, 1.0, 1.2. The closed neighborhood degrees are 1.5, 1.8, 1.5, 1.8, 1.5, 1.8. We have,. Proposition 4.16 Every complete bipolar fuzzy graph is strong bipolar fuzzy graph. Proof Since G is complete bipolar fuzzy graph, all edges in G are strong and all vertices are joined together. Obviously, G is strong bipolar fuzzy graph. Note: Converse need not be true Proposition 4.17 Every semicomplete bipolar fuzzy graph is semiregular bipolar fuzzy graph. Proof Let G be semicomplete bipolar fuzzy graph. By definition 4.6, all vertices in G are connected together, but the edges are not necessarily strong. For the closed neighborhood degree computation, the strong edge condition would not affect. Therefore, the closed neighborhood degrees of all vertices are same. Hence, G is semiregular. Converse of the proposition 4.17 is also true. Proof is obvious. Example 4.18 Let,,, be a semicomplete bipolar fuzzy graph, where,,,,, with 0.5, 0.6, 0.6, 0.7, 0.8, 0.6 ; 0.5, 0.6, 0.4, 0.6, 0.6, 0.5. By usual calculations, the closed neighborhood degrees are 1.9, 1.9, 1.9, 1.9, 1.9, 1.9. Therefore, G is semiregular. 5 Conclusions In this paper, the effective degree of a vertex and degree of a vertex in bipolar fuzzy graph, semicomplete bipolar fuzzy graph and semiregular bipolar fuzzy graph are introduced and some of their propositions are examined. Based on these ideas, we can extend our research work to other graph theory areas by using bipolar fuzzy graph; also construct a network model for bipolar fuzzy graph and establish algorithm oriented solution. References [1] M. kram, Bipolar fuzzy graphs, Information Sciences 181 (2011)

10 4866 Basheer hamed Mohideen [2] M. kram and W.. Dudek, Regular bipolar fuzzy graphs, Neural Computing and pplications, 1 (2012) [3] M. kram, Bipolar fuzzy graphs with applications, Knowledge-Based Systems 39 (2013) 1 8. [4] M. Basheer hamed and. Nagoor Gani, Closed neighborhood degree and its extension in fuzzy graphs, Far East Journal of pplied Mathematics, Vol. 40, Issue 1, 2010, pp [5] Bhattacharya, P., Some remarks on fuzzy graphs, Pattern recognition letter (1987), [6] K. R. Bhutani and. Rosenfeld, Strong arcs in fuzzy graphs, Information Sciences, 152 (2003) [7] F. Harary, Graph Theory, Third ed., ddison-wesley, Reading, M, [8]. Kauffman, Introduction a la Theorie des Sous-emsembles Flous, Paris: Masson et Cie Editeurs, [9] J. N. Mordeson and P. S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, Physica-Verlag, Heidelberg, [10]. Nagoor Gani and M. Basheer hamed, Order and Size in Fuzzy Graphs, Bulletin of Pure and pplied Sciences, Vol. 22E (No.1) 2003; p [11]. Rosenfeld, Fuzzy graphs, in L.. Zadeh, K.S.Fu, K. Tanaka, and M. Shimura, eds., FuzzySets and their pplications to Cognitive and Decision Processes, cademic Press, New York (1975) [12] L.. Zadeh, Fuzzy sets, Information and Control 8 (1965) [13] W. R. Zhang, Bipolar fuzzy sets and relations: a computational framework forcognitive modeling and multiagent decision analysis, Proceedings of IEEE Conf., 1994, pp [14] W. R. Zhang, Bipolar fuzzy sets, Proceedings of FUZZ-IEEE (1998) Received: July 12, 2013

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Tree Cover of Graphs

Applied Mathematical Sciences, Vol. 8, 2014, no. 150, 7469-7473 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.49728 Tree Cover of Graphs Rosalio G. Artes, Jr. and Rene D. Dignos Department

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

### A note on properties for a complementary graph and its tree graph

A note on properties for a complementary graph and its tree graph Abulimiti Yiming Department of Mathematics Institute of Mathematics & Informations Xinjiang Normal University China Masami Yasuda Department

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem

Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### A New Operation on Triangular Fuzzy Number for. Solving Fuzzy Linear Programming Problem

Applied Mathematical Sciences, Vol. 6, 2012, no. 11, 525 532 A New Operation on Triangular Fuzzy Number for Solving Fuzzy Linear Programming Problem A. Nagoor Gani PG and Research Department of Mathematics

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### Unicyclic Graphs with Given Number of Cut Vertices and the Maximal Merrifield - Simmons Index

Filomat 28:3 (2014), 451 461 DOI 10.2298/FIL1403451H Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Unicyclic Graphs with Given Number

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### On the Algebraic Structures of Soft Sets in Logic

Applied Mathematical Sciences, Vol. 8, 2014, no. 38, 1873-1881 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43127 On the Algebraic Structures of Soft Sets in Logic Burak Kurt Department

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### On the Relationship between Classes P and NP

Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### Discernibility Thresholds and Approximate Dependency in Analysis of Decision Tables

Discernibility Thresholds and Approximate Dependency in Analysis of Decision Tables Yu-Ru Syau¹, En-Bing Lin²*, Lixing Jia³ ¹Department of Information Management, National Formosa University, Yunlin, 63201,

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Graphs and Network Flows IE411 Lecture 1

Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### Module1. x 1000. y 800.

Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.

Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

Computing and Informatics, Vol. 20, 2001,????, V 2006-Nov-6 UPDATES OF LOGIC PROGRAMS Ján Šefránek Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University,

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

### A FUZZY LOGIC APPROACH FOR SALES FORECASTING

A FUZZY LOGIC APPROACH FOR SALES FORECASTING ABSTRACT Sales forecasting proved to be very important in marketing where managers need to learn from historical data. Many methods have become available for

### Min-cost flow problems and network simplex algorithm

Min-cost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.

### Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### ABOUT UNIQUELY COLORABLE MIXED HYPERTREES

Discussiones Mathematicae Graph Theory 20 (2000 ) 81 91 ABOUT UNIQUELY COLORABLE MIXED HYPERTREES Angela Niculitsa Department of Mathematical Cybernetics Moldova State University Mateevici 60, Chişinău,

### Graph theoretic approach to analyze amino acid network

Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

### Global secure sets of trees and grid-like graphs. Yiu Yu Ho

Global secure sets of trees and grid-like graphs by Yiu Yu Ho B.S. University of Central Florida, 2006 M.S. University of Central Florida, 2010 A dissertation submitted in partial fulfillment of the requirements

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### On Total Domination in Graphs

University of Houston - Downtown Senior Project - Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper

### FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### 6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

### Simple Graphs Degrees, Isomorphism, Paths

Mathematics for Computer Science MIT 6.042J/18.062J Simple Graphs Degrees, Isomorphism, Types of Graphs Simple Graph this week Multi-Graph Directed Graph next week Albert R Meyer, March 10, 2010 lec 6W.1

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### Extremal Graphs without Three-Cycles or Four-Cycles

Extremal Graphs without Three-Cycles or Four-Cycles David K. Garnick Department of Computer Science Bowdoin College Brunswick, Maine 04011 Y. H. Harris Kwong Department of Mathematics and Computer Science

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### arxiv:math/ v2 [math.nt] 10 Nov 2007

Non-trivial solutions to a linear equation in integers arxiv:math/0703767v2 [math.nt] 10 Nov 2007 Boris Bukh Abstract For k 3 let A [1, N] be a set not containing a solution to a 1 x 1 + + a k x k = a

### Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### An Open Integrated Environment for Transparent Fuzzy Agents Design

An Open Integrated Environment for Transparent Fuzzy Agents Design Department of Mathematics and Computer Science, University of Salerno via Ponte don Melillo, 84084 Fisciano, Salerno, Italy {gacampora,loia}@unisa.it

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### MANAGEMENT OPTIMIZATION PROBLEMS ON FUZZY GRAPHS

Investigaciones Europeas de Dirección y Economía de la Empresa Vol. 1, W 3,1995, pp. 63-69. MANAGEMENT OPTIMIZATION PROBLEMS ON FUZZY GRAPHS Krasnoproshin, V. Obraztsov, V. Belarus State University ABSTRACT

### Introduction to Flocking {Stochastic Matrices}

Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur - Yvette May 21, 2012 CRAIG REYNOLDS - 1987 BOIDS The Lion King CRAIG REYNOLDS

### Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### Social Media Mining. Network Measures

Klout Measures and Metrics 22 Why Do We Need Measures? Who are the central figures (influential individuals) in the network? What interaction patterns are common in friends? Who are the like-minded users

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### Multi-layer Structure of Data Center Based on Steiner Triple System

Journal of Computational Information Systems 9: 11 (2013) 4371 4378 Available at http://www.jofcis.com Multi-layer Structure of Data Center Based on Steiner Triple System Jianfei ZHANG 1, Zhiyi FANG 1,

### FS I: Fuzzy Sets and Fuzzy Logic. L.A.Zadeh, Fuzzy Sets, Information and Control, 8(1965)

FS I: Fuzzy Sets and Fuzzy Logic Fuzzy sets were introduced by Zadeh in 1965 to represent/manipulate data and information possessing nonstatistical uncertainties. L.A.Zadeh, Fuzzy Sets, Information and

### ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

### SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE

SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### diffy boxes (iterations of the ducci four number game) 1

diffy boxes (iterations of the ducci four number game) 1 Peter Trapa September 27, 2006 Begin at the beginning and go on till you come to the end: then stop. Lewis Carroll Consider the following game.

### 1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

### Inclusion degree: a perspective on measures for rough set data analysis

Information Sciences 141 (2002) 227 236 www.elsevier.com/locate/ins Inclusion degree: a perspective on measures for rough set data analysis Z.B. Xu a, *, J.Y. Liang a,1, C.Y. Dang b, K.S. Chin b a Faculty