Compactness of Fuzzy Sets
|
|
- Kathleen Small
- 5 years ago
- Views:
Transcription
1 Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i fuzzy topological spaces, especially the coectio betwee compact, closed ad bouded fuzzy sets. 1-Itroductio: The cocept of fuzzy sets was itroduced iitially by Zadeh i Sice the, this cocept is used i topology ad some braches of aalysis, may authors have expesively developed the theory of fuzzy sets ad its applicatio [1]. Chag, C. L. i 1968 used the fuzzy set theory for defiig ad itroducig fuzzy topological spaces, while Wog, C. K. i 1973, discussed the coverig properties of fuzzy topological spaces, [2]. Ercey, M. A. i 1979, studied fuzzy metric spaces ad its coectio with statistical metric spaces, Mig P. P. ad Mig L. Y. i 1980, used fuzzy topology to defie eighborhood structure of fuzzy poit ad Moore- Smith covergece, Zike Deg i 1982, studied the fuzzy poit ad discussed the fuzzy metric spaces with the metric defied betwee two fuzzy poits,[ 3]. The mai objective of this paper is to study the relatioship betwee closed ad bouded fuzzy sets ad the compactess of such fuzzy sets. 2- Basic Cocepts i uzzy Topology [3], [4], [5]: Chag C. L. i 1968 itroduced the otio of fuzzy topological spaces, which is ao-empty set X together with a family of fuzzy sets i X which is closed uder arbitrary uio ad fiite itersectio, as it is give precisely i the ext defiitio. We start first with the obvious defiitio of fuzzy topological spaces.
2 Defiitio (3.1),[3][7]: A family T of fuzzy sets of X is called a fuzzy topology for X if ad oly if it satisfyig the followig coditios: (a), 1 X T.where is the empty fuzzy set with membership fuctio 0 ad 1x is the uiversal set with membership fuctio 1. (b) If A, B T, the A B T. (c) If A i T, i J, where J is ay idex set, the A T. ii T is called fuzzy topology for X, ad the pair (X, T ) is a fuzzy topological space. Defiitio (3.2),[3]: A fuzzy set A X* is said to be a ope fuzzy set if A T ad is said to c be closed fuzzy set if A T. X* is the set of all closed ad bouded fuzzy subsets of X Defiitio (3.3), [2][4]: Let (X, T ) be a fuzzy topological space. A family of fuzzy subsets A of I X is said to be a cover of a fuzzy set B i X if ad oly if B A. If each member of the cover is a member of T, the this cover is said to be a ope cover of B. A subcover of B is a subfamily of the cover which is also a cover. Defiitio (3.4),[5]: A fuzzy topological space is compact if ad oly if each ope cover of the space has a fiite subcover. Defiitio (3.5),[5]: A fuzzy poit x r of fuzzy set A i a fuzzy topological space (X, T ) is said to be fuzzy -cluster poit (fuzzy -cluster poit) of a fuzzy set A i X if ad oly if fuzzy closure (respectively, iterior of i the closure) of every ope q- eighborhood of x r is q-coicidet with A 3- Compactess uzzy Set: The compactess set is oe of the fudametal aspects i topological space, i geeral, ad of fuzzy set i particular, therefore, several approaches are proposed to study this subject. Hece, i this sectio, we will give oe of such approaches as a theorem. Also, we will stad ad preset some of the basic ideas for the costructio ad the proof of the completeess of fuzzy set, where the followig abbreviatio is used, X* is the set of all closed ad bouded fuzzy subsets of X. Theorem(4.1): If a fuzzy set is oempty ad is bouded below, the a ifimum exist. Let A be a oempty fuzzy set which is bouded below. Deote by C1 the fuzzy the set of all real umbers which are lower bouds of A, ad let C2 cosist of all other real umbers. We may the show that [C1, C2] is a Dedekid. 1- The ature of the defiitio of C2 is a assurace that each real umber is i C1 or C2. 2- Sice A is bouded below, C1 is o empty ad sice A is ot empty, ot all real umbers are i C1. Hece C2 is ot empty. 3- Let c1 be ay member of C1, ad let C be ay umber such C < C1.it follows that C is less tha a lower
3 boud of A ad hece is also a lower boud of A.therefore c is a member of C1. This implies that all members of C2 exceed all members of C1. 4- Suppose C2 to have a least member. Deote it by c. the c is ot a lower boud of A, ad, as a cosequece, a umber x of A exists such that x < C. Also, betwee x ad C exists aother real umber y, x < y < C, sice y is less tha c, it is ecessarily i C1. Also, sice y exceeds x; a member of A, it is ot a lower boud ad so is ot i C1.the cotradictio implies that C2 does ot possess a least member. Theorem (4.2): The ifimum of a oempty fuzzy set A is either a member of A or a cluster poit of A. Let b if A, be a fuzzy set with membership fuctio b (x) if A (x), x X It is the miimum fuzzy poit of A, if b is a member of A While if b is ot a member of A, the correspodig to each positive umber > 0, the deleted fuzzy eighborhood * N (b, ) cotais a poit a of A. Hece b is a cluster poit of A. Theorem (4.3): A oempty closed fuzzy set A, which is bouded below possesses a miimum poit. By theorem (4.1) the ifimum of the fuzzy set A exists a fuzzy poit b which is either a poit of A or a cluster poit of A. I the latter case it also follows that b is i A, sice A is closed. Hece the ifimum of A belogs to A ad is, of course, the miimum member of A. Theorem (4.4): Ay family of disjoit fuzzy itervals is coutable. Let { I } be a sequece of fuzzy itervals hece, for all (0, 1], let I [ I, I I] ad hece, their is a equivalet two sequece of ofuzzy itervals { I } ad { I } which are coutable hece { I } is coutable. Similarly, usig the idea of -level sets, oe ca state ad prove the followig theorem: Theorem (4.5): Ay oempty ope fuzzy set is the uio of a uique coutable collectio of disjoit ope itervals. 4- The Mai Results: Deotig that member of the family which correspods to the iteger by A, we may represet the sequece by A 1, A 2,, A, ; or by the symbol {A }, If a sequece of fuzzy sets of poits has the property that A +1 A for each, the the sequece is referred to as decreasig or ested, cocerig a ested sequece of sets each of which is closed, we state the followig. Theorem (5.1):
4 If { } is a ested sequece of o empty, closed, ad bouded fuzzy set, the the fuzzy set empty, where 1 1 (x) (x). is o By theorem (4.3) each of the fuzzy set possesses a maximum poit. Let X X max, for each (x) max (x), from the hypothesis 1 1, (x) < (x). It follows that 1 X, ad for each positive iteger q it is the case that X, for all q. Deote the fuzzy set of umbers X by T, because T 1 ad 1 is bouded, it follows that T is bouded ad, particular, is bouded below. Deotig the ifimum of T by c. We shall show that c, for all. Let q deote a arbitrary positive iteger, ad cosider the subset of T defied by T q { X : q}, sice c is the ifimum of T, it is also the ifimum of T q, by theorem (4.2) it follows that c T q. Also, sice: q X q T q (x). q, we have T (x) q Now, cosider the followig remarks: Remarks (5.1): A. Let =, for all positive itegers where is the empty fuzzy set with membership fuctio 0. The is closed ad bouded, ad { } is ested. However, the fuzzy set 1 1, with membership fuctio (x) (x) is empty sice the empty. are ot o B. Let {(x, (x),where xx is the uiversal set with membership fuctio 1.} here the sequece { } is ested ad is oempty ad closed for each. however, each is ubouded. It is easy to see that 1 (x) (x), with membership fuctio is empty. 1 C. Let (0, 1/], the sequece { } is obviously ested, each is oempty ad bouded but ot closed. The set membership fuctio (x) (x), seems to be empty. 1, with 1 D. Let [2, 2+1]. Here each is oempty closed, ad bouded, but the sequece { } is ot ested. The set 1 fuctio (x) Therem (5.2):, with membership (x) is empty. 1 If L * is ay ope coverig of a fuzzy set A, the there exists a
5 coutable subfamily of L which also covers the fuzzy set A. Let a deote ay member of the give fuzzy set A. The a fuzzy set G a of L exists such that a G a. urther, sice G a is ope, a eighborhood N(a, ) exists such that N(a, ) G a. Now, let r 1 ad r 2 desigate two ratioal umbers with the property that a < r 1 < a < r 2 < a+. It is the the case that the iterval I a (r 1, r 2 ) is such that a I a ad I q G a. Hece, i this maer we may associate with each member a of the fuzzy set A a ope iterval I a with ratioal ed poits. Sice the fuzzy set of all possible itervals with ratioal ed poits is coutable, if follows that the fuzzy set B {I a : a A } is also coutable. Each iterval I a is cotaied i at least oe of the ope fuzzy sets of L ad deote oe such by G a. I this way a subfamily L of L is costructed with the property that with each iterval I a of the coutable fuzzy set B is associated exactly oe member G a of L. Cosequetly L is coutable ad, moreover, covers A sice for each member a of A we have a I a ad I a G a. Theorem (5.3): Let X lr be the uiversal set, the a fuzzy subset of X is closed ad bouded the it is compact. Let A X be a closed ad bouded fuzzy subset of X ad a family of a fuzzy sets A is a cover of a fuzzy set A if ad oly if B { A A A} It is a ope cover if ad oly if each member of A is a ope fuzzy set A. Because of the (Lidelof theorem i fuzzy sets), we may assume, without loss of geerality, that B be a coutable ad thereby deote its members by G 1, G,, G, ad defie the fuzzy set: 2 K K Gi i1 ad L A y which is s also a fuzzy set of X with membership fuctio, for ay idex J L G j (x) sup ij = Mi { A (x) L (x) for 1, 2, Gi (x), x X, y K (x) }, ad observe that, because of the theorems o uios ad itersectio of closed ad ope fuzzy set, the fuzzy set K are ope ad the fuzzy set L closed for all values of. further, it is the case that: K K 1, the K1 (x), x X ad from this follows L (x) L 1 L, the, x X, for all. K (x) L1 (x) Assume ow that oe of the fuzzy sets L is empty fuzzy set, the: ad hece: L (x) 1, sice L A L (x) < A (x), x X 1 < A (x), ad hece A is bouded
6 It follows the that the sequece { L } { L 1 }, 1, 2, ; i.e., all. L (x) < L (x) 1, x X, for Satisfies the hypotheses of the theorem (5.2) L 1 L 1 L 1 (x) (x) L 1 if L (x), x X Therefore, for some positive iteger q the fuzzy set L q A K q is empty. mi{ A (x) Lq (x), Kq (x) } 0, for ay idex j, j 1, 2,, q Hece, A x X K q q Gi i1, i.e., A (x) < Kq (x) q (x) Gi i1 sup ij Gi (x), A C (sice A (x) C (x) ) A may be covered by the set C. Let B deote the family of ope fuzzy sets of fuzzy poits G, defied by: G G {(x, G (x) ) : x X, (x), for each positive iteger } It is obvious that B is a ope coverig of the fuzzy set of all real umbers ad hece of ay fuzzy set of real umbers suppose ow that A X* is some compact fuzzy set, A T. The, sice ay ope coverig of A possesses a fiite sub family which also covers A. It follows, i particular, that this is true of B. Cosequetly, a fiite collectio of itervals G covers the fuzzy set A, ad, if deotes the maximum subscript for this fiite family, the clearly the ope iterval: 0 G 0 {(x, (x) 0} G 0 covers A. (x)) : x X; G 0 This implies that a compact fuzzy set is bouded. To show that A is ecessarily closed, let c be a real umber ad cosider the family of closed fuzzy sets: (x) {(x, x X, c 1/ (x) c + 1/}, 1, 2, The fuzzy sets H, 1, 2, H (x) (x), 1, 2, The costitute a family of ope fuzzy sets. It is obvious that the set (x) 1 if ij (x) i 1, x X for j ay idex set cosists of the sigle poits, ad, sice c i et i A, it follows that: i.e., A 1
7 X (1) where: X..(2) A (x) < (x) 1 if ij (x) A (x) < (x) Hi i1 sup ij i, x Hi (x), x Thus the fuzzy set A is covered by the family. The compactess of A implies that a fiite subfamily of exists which also covers A. Therefore a positive iteger 1 exists such that each poit of A is cotaied i at least oe of the ope fuzzy sets H 1, H 2,, H, ; the, o poit of A is cotaied i: 1/ 1 1 {(x, 1 1 (x) (x) c + 1/ 1} ) : x X, c ad from this it follows that the poit c is ot a cluster poit of the fuzzy set A. Thus it is proved that ay poit which is ot a poit of the fuzzy set A is also ot a cluster poit of A. All cluster poits of A are, therefore, poits of A itself. Hece A is closed.
8 تراص الوجووعات الضبابية أهاني التفات كاظن قسن علوم هنذسة البراهجيات كلية هذينة العلن الجاهعة بغذاد العراق الوستخلص يهدف هذا البحث الى دراسة تزاص المجمىعات الضبابية في العالقة بين التزاص,انغالق, وتقييد المجمىعات الضبابية. الفضاءات التبىلىجية الضبابية وباألخص 5- Refereces: 1. Dubois, D. ad Prade, H., uzzy Sets ad Systems: Theory ad Applicatios, Academic Press, Ic., (1980). 2. Muir, M.A.K., O Separatio Axioms of uzzy Topological Spaces'', Ph.D. Thesis, College of Educatio, Al-Mustasiriah Uiversity, (2006). 3. adhel,. S., About uzzy ixed Poit Theorem, Ph.D. Thesis, College of Sciece, Al-Nahrai Uiversity, (1998). 4. Joh, D., Itroductio to Real Aalysis'', Joh Wiley ad Sos, (1988). 5. Mary, M.G., urther Results About uzzy Metric Spaces'', M.Sc. Thesis, College of Educatio, Al-Mustasiriah Uiversity, (2004). 6. Burill, C.W. ad Kudse, J.R. Real Variables'', Holt, Riehart ad Wisto, Ic., (1969). 7. Amai, A.K., About the completeess of fuzzy metric spaces, M.SC. thesis,college of sciece, AL-Naharai Uiversity, Baghdad, Iraq
Strong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationTakashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
TOPOLOGY Takashi Tsuboi Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa Keywords: eighborhood, ope sets, metric space, covergece, cotiuity, homeomorphism, homotopy type, compactess,
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationTHE COMPETITION NUMBERS OF JOHNSON GRAPHS
Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationInternational Journal of Pure and Applied Sciences and Technology
It J Pure App Sci Techo 6( (0 pp7-79 Iteratioa Joura of Pure ad Appied Scieces ad Techoogy ISS 9-607 Avaiabe oie at wwwijopaasati Research Paper Reatioship Amog the Compact Subspaces of Rea Lie ad their
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationPRIMITIVE σ-spaces. by Rick E. Ruth
Volume 8, 1983 Pages 315 328 http://topology.aubur.edu/tp/ PRIMITIVE σ-spaces by Rick E. Ruth Topology Proceedigs Web: http://topology.aubur.edu/tp/ Mail: Topology Proceedigs Departmet of Mathematics &
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY
ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY m. rosefeld1 1. Itroductio. We cosider i this paper oly fiite odirected graphs without multiple edges ad we assume that o each vertex of the graph there is
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationON MATHIEU-BERG S INEQUALITY
ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationRelational Interpretations of Neighborhood Operators and Rough Set Approximation Operators
Relatioal Iterpretatios of Neighborhood Operators ad Rough Set Approximatio Operators Y.Y. Yao Departmet of Computer Sciece, Lakehead Uiversity, Thuder Bay, Otario, Caada P7B 5E1, E-mail: yyao@flash.lakeheadu.ca
More informationSymmetric Class 0 subgraphs of complete graphs
DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth
More informationJournal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones
Joural of Mathematical Naoscieese 7 2) 2017) 85 95 Joural of Mathematical Naosciece Available Olie at: http://jmathaosrttuedu Saskruti Idex of Bridge Graph ad Some Naocoes K Pattabirama * Departmet of
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationSome New Results on Prime Graphs
Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationUSING TOPOLOGICAL METHODS TO FORCE MAXIMAL COMPLETE BIPARTITE SUBGRAPHS OF KNESER GRAPHS
USING TOPOLOGICAL METHODS TO FORCE MAXIMAL COMPLETE BIPARTITE SUBGRAPHS OF KNESER GRAPHS GWEN SPENCER AND FRANCIS EDWARD SU 1. Itroductio Sata likes to ru a lea ad efficiet toy-makig operatio. He also
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More information4-Prime cordiality of some cycle related graphs
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationRainbow Vertex Coloring for Line, Middle, Central, Total Graph of Comb Graph
Idia Joural of Sciece ad Techology, Vol 9(S, DOI: 0.7485/ijst/206/v9iS/97463, December 206 ISSN (Prit : 0974-6846 ISSN (Olie : 0974-5645 Raibow Vertex Colorig for Lie, Middle, Cetral, Total Graph of Comb
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationXiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation
Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationCS473-Algorithms I. Lecture 2. Asymptotic Notation. CS 473 Lecture 2 1
CS473-Algorithms I Lecture Asymptotic Notatio CS 473 Lecture 1 O-otatio (upper bouds) f() = O(g()) if positive costats c, 0 such that e.g., = O( 3 ) 0 f() cg(), 0 c 3 c c = 1 & 0 = or c = & 0 = 1 Asymptotic
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More information3. b. Present a combinatorial argument that for all positive integers n : : 2 n
. b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of
More informationThe metric dimension of Cayley digraphs
Discrete Mathematics 306 (2006 31 41 www.elsevier.com/locate/disc The metric dimesio of Cayley digraphs Melodie Fehr, Shoda Gosseli 1, Ortrud R. Oellerma 2 Departmet of Mathematics ad Statistics, The Uiversity
More informationData Structures Week #9. Sorting
Data Structures Week #9 Sortig Outlie Motivatio Types of Sortig Elemetary (O( 2 )) Sortig Techiques Other (O(*log())) Sortig Techiques 21.Aralık.2010 Boraha Tümer, Ph.D. 2 Sortig 21.Aralık.2010 Boraha
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationOn Ryser s conjecture for t-intersecting and degree-bounded hypergraphs arxiv: v2 [math.co] 9 Dec 2017
O Ryser s cojecture for t-itersectig ad degree-bouded hypergraphs arxiv:1705.1004v [math.co] 9 Dec 017 Zoltá Király Departmet of Computer Sciece ad Egerváry Research Group (MTA-ELTE) Eötvös Uiversity Pázmáy
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationABOUT A CONSTRUCTION PROBLEM
INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of
More informationINSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo
More informationPlanar graphs. Definition. A graph is planar if it can be drawn on the plane in such a way that no two edges cross each other.
Plaar graphs Defiitio. A graph is plaar if it ca be draw o the plae i such a way that o two edges cross each other. Example: Face 1 Face 2 Exercise: Which of the followig graphs are plaar? K, P, C, K,m,
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationOn Characteristic Polynomial of Directed Divisor Graphs
Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationSpanning Maximal Planar Subgraphs of Random Graphs
Spaig Maximal Plaar Subgraphs of Radom Graphs 6. Bollobiis* Departmet of Mathematics, Louisiaa State Uiversity, Bato Rouge, LA 70803 A. M. Frieze? Departmet of Mathematics, Caregie-Mello Uiversity, Pittsburgh,
More informationThompson s Group F (p + 1) is not Minimally Almost Convex
Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationData Structures Week #5. Trees (Ağaçlar)
Data Structures Week #5 Trees Ağaçlar) Trees Ağaçlar) Toros Gökarı Avrupa Gökarı October 28, 2014 Boraha Tümer, Ph.D. 2 Trees Ağaçlar) October 28, 2014 Boraha Tümer, Ph.D. 3 Outlie Trees Deiitios Implemetatio
More information