The Nature Diagnosability of Bubble-sort Star Graphs under the PMC Model and MM* Model

Size: px
Start display at page:

Download "The Nature Diagnosability of Bubble-sort Star Graphs under the PMC Model and MM* Model"

Transcription

1 Iteratioal Joural of Egieerig ad Applied Scieces (IJEAS) ISSN: Volume-4 Issue-8 August 07 The Nature Diagosability of Bubble-sort Star Graphs uder the PMC Model ad MM* Model Mujiagsha Wag Yuqig Li Shiyig Wag Abstract May multiprocessor systems have itercoectio etworks as uderlyig topologies ad a itercoectio etwork is usually represeted by a graph where odes represet processors ad liks represet commuicatio liks betwee processors No fault set ca cotai all the eighbors of ay fault-free vertex i the system which is called the ature diagosability of the system Diagosability of a multiprocessor system is oe importat study topic As a famous topology structure of itercoectio etworks the -dimesioal bubble-sort star graph has may good properties I this paper we prove that the ature diagosability of is 4 7 uder the PMC model for 4 the ature diagosability of model for 5 is 4 7 uder the MM* Idex Terms Bubble-sort star graph Diagosability Itercoectio etwork I INTRODUCTION May multiprocessor systems have itercoectio etworks (etworks for short) as uderlyig topologies ad a etwork is usually represeted by a graph where odes represet processors ad liks represet commuicatio liks betwee processors Some processors may fail i the system so processor fault idetificatio plays a importat role for reliable computig The first step to deal with faults is to idetify the faulty processors from the fault-free oes The idetificatio process is called the diagosis of the system A system G is said to be t -diagosable if all faulty processors ca be idetified without replacemet provided that the umber of preseted faults does ot exceed t The diagosability tg ( ) of G is the maximum value of t such that G is t -diagosable For a t -diagosable system Dahbura ad Masso [] proposed a algorithm with time 5 complex O ( ) which ca effectively idetify the set of faulty processors Several diagosis models (eg Preparata Metze ad Chie's (PMC) model [] Barsi Gradoi ad Maestrii's (BGM)model [3] ad Maeg ad Malek's (MM) model [4] have bee proposed to ivestigate the diagosability of multiprocessor systems I particular two of the proposed models the PMC model ad the MM model are well kow ad widely used I the PMC model the diagosis of the system is achieved through two liked processors testig each other I the MM model to diagose a system a ode seds the same task to two of its eighbors ad the compares their resposes For this reaso the MM model is Mujiagsha Wag School of Electrical Egieerig ad Computer Sciece The Uiversity of Newcastle NSW 308 Australia Yuqig Li School of Electrical Egieerig ad Computer Sciece The Uiversity of Newcastle NSW 308 Australia *Shiyig Wag School of Mathematics ad Iformatio Sciece Hea Normal Uiversity Xixiag PR Chia also said to be the compariso model Segupta ad Dahbura [] proposed a special case of the MM model called the MM* model i which each ode must test its ay pair of adjacet odes Numerous studies have bee ivestigated uder the PMC model ad MM model or MM* model I the traditioal diagosis of a multiprocessor system oe geerally assumes that ay subset of processors may simultaeously fail If all the eighbors of some ode v are faulty simultaeously it is impossible to determie whether v is faulty or fault-free As a cosequece the diagosability of the system is less tha its miimum ode degree However i some large-scale multiprocessor systems we ca safely assume that all eighbors of ay ode do ot fail at the same time Based o this assumptio i 005 Lai et al [5] itroduced the restricted diagosability of the system called the coditioal diagosability They cosider the situatio that o fault set ca cotai all the eighbors of ay ode i the system Sice the probability that the all eighbors of a fault ode fail ad create faults is more to the probability that the all eighbors of a fault-free ode fail ad create faults i the system we cosider the situatio that o fault set ca cotai all the eighbors of ay fault-free ode i the system which is called the ature diagosability of the system I 0 Peg et al [6] proposed a measure for fault diagosis of the system amely the g-good-eighbor diagosability (which is also called the g-good-eighbor coditioal diagosability) which requires that every fault-free ode cotais at least g fault-free eighbors I [6] they studied the g-good-eighbor diagosability of the -dimesioal hypercube uder the PMC model I [7] Wag ad Ha studied the g-good-eighbor diagosability of the -dimesioal hypercube uder the MM* model I 06 Re ad Wag [8] gave some properties of the g-good-eighbor diagosability of a multiprocessor system I 07 Wag et al [9] studied that the -good-eighbor diagosability of bubble-sort star graph etworks uder the PMC model ad MM* model Yua et al [0] studied that the g-good-eighbor diagosability of the k-ary -cube ( k 3) uder the PMC model ad MM* model As a favorable topology structure of itercoectio etworks the Cayley graph C geerated by the traspositio tree has may good properties I [] Wag et al studied the -good-eighbor diagosability of C uder the PMC model ad MM* model I 06 Zhag et al [3] proposed a ew measure for fault diagosis of the system amely the g-extra diagosability which restrais that every fault-free compoet has at least (g+) fault-free odes I [3] they studied the g-extra diagosability of the -dimesioal hypercube uder the PMC model ad MM* model I 06 Wag et al [4] studied that the -extra diagosability of the -dimesioal bubble-sort star graph uder the PMC model ad MM* model I [5] Ha ad Wag studied that the 55 wwwijeasorg

2 The Nature Diagosability of Bubble-sort Star Graphs uder the PMC Model ad MM* Model g -extra diagosability of folded hypercubes I 07 Wag ad Yag [6] studied the -good-eighbor (-extra) diagosability of alteratig group graph etworks uder the PMC model ad MM* model I [7] Wag et al studied the ature diagosability of C uder the PMC model ad MM* model ad proved that the ature diagosability of the system is less tha or equal to the coditioal diagosability of the system Therefore the ature diagosability of the system is ature ad oe importat study topic I 06 Bai ad Wag [8] studied the ature diagosability of M o bius cubes; Hao ad Wag [9] studied the ature diagosibility of augmeted k-ary -cubes; Jirimutu ad Wag [0] studied the ature diagosability of alteratig group graph etworks; Ma ad Wag [] studied the ature diagosability of crossed cubes; Zhao ad Wag [] studied the ature diagosability of augmeted 3-ary -cubes The star graph ad the bubble-sort graph have bee proved to be a importat viable cadidate for itercoectig a multiprocessor system The feature of the star graph iclude low degree of ode small diameter symmetry ad high degree of fault-tolerace The diagosabilities of the star graph uder the PMC model ad MM model were studied i [34] Li et al [5] showed that the coditioal diagosability of the star graph uder the compariso diagosis model is 3 7 I this paper the ature diagosability of the -dimesioal bubble-sort star graph uder the PMC model ad MM* model has bee studied It is proved that the ature diagosability of is 4 7 uder the PMC model for 4 the ature diagosability of is 4 7 uder the MM* model for 5 II PRELIMINARIES I this sectio some defiitios ad otatios eeded for our discussio the bubble-sort star graph the PMC model ad MM* model are itroduced A Defiitios ad Notatios A multiprocessor system is modeled as a udirected simple graph G ( V E) whose vertices (odes) represet processors ad edges (liks) represet commuicatio liks Give a oempty vertex subset V of V the subgraph iduced by V i G deoted by GV [ ] is a graph whose vertex set is V ad the edge set is the set of all the edges of G with both edpoits i V The degree dg () v of a vertex v is the umber of edges icidet with v We deote by ( G) the miimum degrees of vertices of G For ay vertex v we defie the eighborhood NG () v of v i G to be the set of vertices adjacet to v u is called a eighbor or a eighbor vertex of v for u N () v Let S V We use N ( ) G S to deote the set vs NG ( v) \ S For eighborhoods ad degrees we will usually omit the subscript for the graph whe o cofusio arises A graph G is said to be k -regular if for ay vertex v dg () v k Let G be a coected graph The coectivity ( G) of a graph G is the miimum umber of vertices whose removal results i a discoected graph or oly oe vertex left whe G is complete A fault set F V G is called a ature faulty set if N( v) ( V \ F) for every vertex v i V\ F A ature cut of G is a ature faulty set F such that G F is discoected The miimum cardiality of ature cuts is said to be the ature coectivity of G deoted by * ( G) For graph-theoretical termiology ad otatio ot defied here we follow [6] B The PMC model ad MM* model For the PMC model ad MM* model we follow [0] I a system G ( V E) a faulty set F V is called a coditioal faulty set if it does ot cotai all of eighbors of ay vertex i G A system G is coditioal t -diagosable if every two distict coditioal faulty subsets F F V with F t F t are distiguishable The coditioal diagosability tc ( G ) of G is the maximum umber of t such that G is coditioal t -diagosable By [7] t ( G) t( G) c Theorem ([7]) For a system G ( V E) t( G) t0( G) t ( ) ( ) G tc G I [7] Wag et al proved that the ature diagosability of the Bubble-sort graph B uder the PMC model is 3 for 4 I [8] Zhou et al proved the coditioal diagosability of B is 4 for 4 uder the PMC model Therefore t ( B ) t ( B ) whe 5 ad t ( B ) t ( B ) whe 4 c c C The bubble-sort star graph The bubble-sort star graph has bee kow as a famous topology structure of itercoectio etworks I this sectio its defiitio ad some properties are itroduced Let [ ] { } ad let S be the symmetric group o [ ] cotaiig all permutatios p pp p of [ ] It is well kow that {( i) : i } is a geeratig set for S So {( i) : i } {( i i ) : i } is also a geeratig set for S The -dimesioal bubble-sort star graph [930] is the graph with vertex set V ( ) = S i which two vertices u v are adjacet if ad oly if u v( i) i or u v( i i ) i It is easy to see from the defiitio that graph o! vertices Note that is a special Cayley graph is a ( 3) -regular has the followig useful properties Propositio For ay iteger is ( 3) - regular vertex trasitive Propositio For ay iteger is bipartite Propositio 3 For ay iteger 3 the girth of is 4 Theorem ([3]) Let H be a simple coected graph with V ( H ) 3 If H ad H are two differet labelled graphs obtaied by labellig H with { } Cay H S is isomorphic to Cay( H S ) ( ) the We ca partitio ito subgraphs where every vertex u xx x V ( ) has a fixed iteger i i the last positio x for i [ ] It is obvious that 56 wwwijeasorg

3 i i is isomorphic to for i [ ] Let v V( ) The v( ) ad v( ) are called outside eighbors of v i Propositio 3 ([9]) Let be defied as above The there are ( )! idepedet cross-edges betwee two differet H i 's Propositio 4 ([9]) Let be the bubble-sort star graph If two vertices uv are adjacet there is o commo eighbor vertex of these two vertices ie N( u) N( v) 0 If two vertices uv are ot adjacet there are at most three commo eighbor vertices of these two vertices ie N( u) N( v) 3 * Lemma ([9]) The ature coectivity ( ) of the bubble-sort star graph 4 is 8 A coected graph G is super ature coected if every miimum ature cut F of VG ( ) isolates oe edge If i additio G F has two compoets oe of which is a edge the G is tightly F super ature coected Theorem 3 ([4]) For 5 the bubble-sort star graph is tightly (4 8) super ature coected Lemma Let A {()()} If 4 F N ( A) F A N ( A) the F 4 8 F 4 6 ( F ) ad ( F ) Proof By A {()()} we have [ A ] K Sice has ot 3-cycles N ( A) 4 8 Thus from calculatig we have F 4 8 F A F 4 6 Claim For ay x S \ F N ( x) F ) 4 Sice is a bipartite graph there is o 5-cycle ()( ki) x()( lj )()() of where ( ki)( lj) S \ () Let u N (()) \ () If u is adjacet to x the x is ot adjacet to each of N (()) \ () Sice N (()) \ () 4 we have that x is adjacet to at most ( 4) vertices i F By Claim N ( x) F ) 4 for ay x S \ F Therefore ( F ) 3 ( 4) F has two compoets F ad Note that ( ) Therefore ( F ) III THE NATURE DIAGNOSABILITY OF THE BUBBLE-SORT STAR GRAPH UNDER THE PMC MODEL I this sectio we shall show the ature diagosability of the bubble-sort star graph uder the PMC model Let F ad F be two distict subsets of V for a system G ( V E) Defie the symmetric differece F F ( F \ F ) ( F \ F ) Yua et al [0] preseted a sufficiet ad ecessary coditio for a system to be ature t -diagosable uder the PMC model Theorem 4 ([0]) A system G ( V E) is ature t -diagos -able uder the PMC model if ad oly if there is a edge uv E with u V \ ( F F) ad v F F for each distict Iteratioal Joural of Egieerig ad Applied Scieces (IJEAS) ISSN: Volume-4 Issue-8 August 07 4 pair of ature faulty subsets F ad F of V with F t ad F t Lemma 3 A graph of miimum degree has at least two vertices The proof of Lemma 3 is trivial Lemma 4 Let 4 The the ature diagosability of the bubble-sort star graph uder the PMC model is less tha or equal to 4 7 ie t ( ) 4 7 Proof Let A be defied i Lemma ad let F N ( A) F A N ( A) By Lemma F 4 8 F 4 6 ( F ) ad ( F ) Therefore F ad F are both ature faulty sets of with F 4 8 ad F 4 6 Sice A F F ad N ( A) F F there is o edge of betwee V ( ) \ ( F F) ad F F By Theorem 4 we ca deduce that is ot ature (4 6) -diagosable uder the PMC model Hece by the defiitio of ature diagosability we coclude that the ature diagosability of is less tha 4 6 ie t ( ) 4 7 Lemma 5 Let 4 The the ature diagosability of the bubble-sort star graph uder the PMC model is more tha or equal to 4 7 ie t ( ) 4 7 Proof By the defiitio of ature diagosability it is sufficiet to show that is ature (4 7) -diagosable By Theorem 4 to prove is ature (4 7) -diagosable it is equivalet to prove that there is a edge uv E( ) with u V ( ) \ ( F F) ad v F F for each distict pair of ature faulty subsets F ad F of V ( ) with F 4 7 ad F 4 7 We prove this statemet by cotradictio Suppose that there are two distict ature faulty subsets F ad F of V ( ) with F 4 7 ad F 4 7 but the vertex set pair ( F F ) is ot satisfied with the coditio i Theorem 4 ie there are o edges betwee V ( ) \ ( F F) ad F F Without loss of geerality assume that F \ F Suppose V ( ) F F By the defiitio of F F S! It is obvious that! 8 4 for 4 Sice 4 we have that! V ( ) F F F F F F F F (4 7) 8 4 a cotradictio Therefore V ( ) F F Sice there are o edges betwee V ( ) \ ( F F) ad F F ad F is a ature faulty set F has two parts F F ad [ F \ ] F (for coveiece) Thus ( F F) ad ( [ F \ F]) Similarly ( [ F \ F]) whe F \ F Therefore F F is also a ature faulty set Whe F \ F F F F is also a ature faulty setsice there are o edges betwee V ( F F) ad F F F F is a ature cut Sice 4 by Theorem 3 F F 4 8 By Lemma 3 F \ F Therefore F F \ F F F 4 57 wwwijeasorg

4 The Nature Diagosability of Bubble-sort Star Graphs uder the PMC Model ad MM* Model which cotradicts with that F 4 7 So is ature (4 7) -diagosable By the defiitio of t ( ) t ( ) 4 7 Combiig Lemmas 4 ad 5 we have the followig theorem Theorem 5 Let 4 The the ature diagosability of the bubble-sort star graph uder the PMC model is 4 7 IV THE NATURE DIAGNOSABILITY OF THE BUBBLE-SORT STAR GRAPH UNDER THE MM* MODEL Before discussig the ature diagosability of the bubble-sort star graph uder the MM* model we first give a existig result Theorem 6 ([0]) A system G ( V E) is ature t -diagosable uder the MM* model if ad oly if each distict pair of ature faulty subsets F ad F of V with F t ad F t satisfies oe of the followig coditios () There are two vertices u wv \ ( F F) ad there is a vertex F F such that uw E ad vw E () There are two vertices u v F \ F ad there is a vertex wv \ ( F F ) such that uw E ad vw E (3) There are two vertices u v F \ F ad there is a vertex wv \ ( F F) such that uw E ad vw E Lemma 6 Let 4 The the ature diagosability of the bubble-sort star graph uder the MM* model is less tha or equal to 4 7 ie t ( ) 4 7 Proof Let A F ad F be defied i Lemma By Lemma F 4 8 F 4 6 ( F ) ad ( F ) So both F ad F are ature faulty sets By the defiitios of F ad F FF A Note F \ F F \ F A ad ( V ( ) \ ( F F)) A Therefore both F ad F are ot satisfied with ay oe coditio i Theorem 6 ad is ot ature (3 6) -diagosable Hece t ( ) 4 7 The proof is complete Lemma 7 Let 5 The the ature diagosability of the bubble-sort star graph uder the MM* model is more tha or equal to 4 7 ie t ( ) 4 7 Proof By the defiitio of ature diagosability it is sufficiet to show that is ature (4 7) -diagosable By Theorem 6 suppose o the cotrary that there are two distict ature faulty subsets F ad F of with F 4 7 ad F 4 7 but the vertex set pair ( F F ) is ot satisfied with ay oe coditio i Theorem 6 Without loss of geerality assume that F \ F Similarly to the discussio o V ( ) F F i Lemma 5 we ca deduce that V ( ) F F Therefore V ( ) F F Claim I F F has o isolated vertex Suppose o the cotrary that F F has at least oe isolated vertex w Sice F is a ature faulty set there is a vertex u F \ F such that u is adjacet to w Sice the vertex set pair ( F F ) is ot satisfied with ay oe coditio i Theorem 6 there is at most oe vertex u F \ F such that u is adjacet to w Thus there is just a vertex u F \ F such that u is adjacet to w Similarly we ca deduce that there is just a vertex v F \ F such that v is adjacet to w whe F \ F Let W S \ ( F F) be the set of isolated vertices i [ S \ ( F F)] ad let H be the subgraph iduced by the vertex set S \ ( FF W ) The for ay w W there are ( 5) eighbors i F F Sice F 4 7 we have ww N ( w) W ( 5) d ( v) [( F F ) W ] vf F F F ( 3) ( F )( 3) (4 8)( 3) It follows that W for 5 Note F F F F F F (4 7) ( 5) 6 9 Suppose V( H) The! S V ( ) F F W This is a cotradictio to 5 So V( H) Sice the vertex set pair ( F F ) is ot satisfied with the coditio () of Theorem 6 ad ay vertex of V( H ) is ot isolated i H we iduce that there is o edge betwee V( H ) ad F F Thus F F is a vertex cut of ad ( ( F F)) ie F F is a ature cut of By Theorem 3 F F 4 8 Because F 4 7 F 4 7 ad either F \ F or F \ F is empty we have F \ F F \ F Let F \ F { v} ad F \ F { v } The for ay vertex w W w are adjacet to v ad v Accordig to Propositio 5 there are at most three commo eighbors for ay pair of vertices i it follows that there are at most three isolated vertices i F F ie W 3 Suppose that there is exactly oe isolated vertex v i F F Let v ad v be adjacet to v The N ( v) \{ v v } F F Sice cotais o triagle it follows that N ( v ) \{ v} F F ; N ( v ) \{ v} F F ; [ N ( v) \{ v v }] [ N ( v ) \{ v}] ad [ N ( v) \{ v v }] [ N ( v ) \{ v}] By Propositio 5 [ N ( v ) \{ v}] [ N ( v ) \{ v}] Thus FF N ( v) \{ v v } N ( v ) \{ v} N ( v ) \{ v} ( 5) ( 4) ( 4) 6 5 It follows that F F \ F F F ( 5) which cotradicts F 4 7 Suppose that there are exactly two isolated vertices v ad w i F F Let v ad v be adjacet to v ad w respectively The N ( v) \{ v v} F F Sice cotais o triagle it follows that N ( v ) \{ v w} F F N ( v ) \{ v w } 58 wwwijeasorg

5 [ N ( v) \{ v v }] [ N ( v ) \{ v w}] ad F F [ N ( v) \{ v v }] [ N ( v ) \{ v w}] By Propositio 5 there are at most two commo eighbors for ay pair of vertices i Thus it follows that [ N ( v ) \{ v w}] N v v w Thus F F N v v v [ ( ) \{ }] ( ) \{ } N ( w) \{ v v } N ( v ) \{ v w} N ( v ) \{ v w} ( 5) ( 5) ( 5) ( 5) 8 It follows that F F \ F F F ( 5) which cotradicts F 4 7 Suppose that there are exactly three isolated vertices uv ad w i F F Let v ad v be adjacet to uv ad w respectively The N ( v) \{ v v} F F Sice cotais o triagle it follows that N ( v ) \{ u v w } F F N ( v ) \{ u v w} F F [ N ( v) \{ v v}] [ N ( v ) \{ u v w}] ad [ N ( v) \{ v v}] [ N ( v ) \{ u v w}] By Propositio 5 there are at most three commo eighbors for ay pair of vertices i Thus it follows that [ N ( v ) \{ u v w}] [ N ( v ) \{ u v w}] 0 Thus F F N ( u) \{ v v } N ( v) \{ v v } N ( w) \{ v v } N ( v ) \{ u v w} N ( v ) \{ u v w} ( 5) ( 5) ( 5) ( 6) ( 6) It follows that F F \ F F F ( 5) which cotradicts F 4 7 Suppose F \ F The F F Sice F is a ature faulty set F F F has o isolated vertex The proof of Claim I is complete Let u V ( ) \ ( F F) By Claim I u has at least oe eighbor i F F Sice the vertex set pair ( F F ) is ot satisfied with ay oe coditio i Theorem 6 by the coditio () of Theorem 6 for ay pair of adjacet vertices u wv ( ) \ ( F F) there is o vertex v F F such that uw E( ) ad vw E( ) It follows that u has o eighbor i F F By the arbitrariess of u there is o edge betwee V ( ) \ ( F F) ad F F Sice F \ F ad F is a ature faulty set ([ F \ F]) By Lemma 3 F \ F Sice both F ad F are ature faulty sets ad there is o edge betwee V ( ) \ ( F F) ad F F F F is a ature cut of By Theorem 3 we have F F 4 8 Therefore F F \ F F F (4 8) 4 6 which cotradicts F 4 7 Therefore is ature (4 7) -diagosable ad t ( ) 4 7 The proof is complete Combiig Lemmas 6 ad 7 we have the followig theorem Theorem 7 Let 5 The the ature diagosability of the bubble-sort star graph uder the MM* model is 4 7 Iteratioal Joural of Egieerig ad Applied Scieces (IJEAS) ISSN: Volume-4 Issue-8 August 07 ACKNOWLEDGMENT This work is supported by the Natioal Natural Sciece Foudatio of Chia (NO 67700) REFERENCES [] Dahbura AT Masso GM A 5 O ( ) Fault idetificatio algorithm for diagosable systems IEEE Trasactios o Computers 33 (6) [] Preparata FP Metze G Chie RT O the coectio assigmet problem of diagosable systems IEEE Trasactios o Computers EC [3] Barsi F Gradoi F Maestrii P A Theory of Diagosability of Digital Systems IEEE Trasactios o Computers 5 (6) [4] Maeg J Malek M A compariso coectio assigmet for self-diagosis of multiprocessor systems Proceedig of th Iteratioal Symposium o Fault-Tolerat Computig [5] Lai P-L Ta JJM Chag C-P Hsu L-H Coditioal Diagosability Measures for Large Multiprocessor Systems IEEE Trasactios o Computers 54 () [6] Peg S-L Li C-K Ta JJM Hsu L-H The g-good-eighbor coditioal diagosability of hypercube uder PMC model Applied Mathematics ad Computatio 8 () [7] Wag S Ha W The g-good-eighbor coditioal diagosability of -dimesioal hypercubes uder the MM* model Iformatio Processig Letters [8] Re Y Wag S Some properties of the g-good-eighbor (g-extra) diagosability of a multiprocessor system America Joural of Computatioal Mathematics [9] Wag S Wag Z Wag M The -good-eighbor coectivity ad -good-eighbor diagosability of bubble-sort star graph etworks Discrete Applied Mathematics [0] Yua J Liu A Ma X Liu X Qi X Zhag J The g-good-eighbor coditioal diagosability of k-ary -cubes uder the PMC model ad MM* model IEEE Trasactios o Parallel ad Distributed Systems [] Yua J Liu A Qi X Zhag J Li J g-good-eighbor coditioal diagosability measures for 3-ary -cube etworks Theoretical Computer Sciece [] Wag M Li Y Wag S The -good-eighbor diagosability of Cayley graphs geerated by traspositio trees uder the PMC model ad MM* model Theoretical Computer Sciece [3] Zhag S Yag W The g-extra coditioal diagosability ad sequetial t/k-diagosability of hypercubes Iteratioal Joural of Computer Mathematics 93 (3) [4] Wag S Wag Z Wag M The -extra coectivity ad -extra diagosability of bubble-sort star graph etworks The Computer Joural 59 () [5] Ha W Wag S The g-extra coditioal diagosability of folded hypercubes Applied Mathematical Scieces 9 (46) [6] Wag S Yag Y The -good-eighbor (-extra) diagosability of alteratig group graph etworks uder the PMC model ad MM* model Applied Mathematics ad Computatio [7] Wag M Guo Y Wag S The -good-eighbor diagosability of Cayley graphs geerated by traspositio trees uder the PMC model ad MM* model Iteratioal Joural of Computer Mathematics 94 (3) [8] Bai C Wag S Wag Z The -good-eighbor coectivity ad diagosability of M o bius cubes Advaces i Applied Mathematics 5 (4) [9] Hao Y Wag S The -good-eighbor diagosibility of augmeted k-ary -cubes Advaces i Applied Mathem 5 (4) [0] Jirimutu Wag S The -good-eighbor diagosability of alteratig group graph etworks uder the PMC model ad MM* model Recet Patets o Computer Sciece [] Ma X Wag S Wag Z The -good-eighbor coectivity ad diagosability of crossed Cubes Advaces i Applied Mathematics 5 (3) [] Zhao N Wag S The -good-eighbor diagosability of augmeted 3-ary -cubes Advaces i Applied Mathematics5 (4) [3] Kaviapour A Sequetial diagosability of star graphs Computers ad Electrical Egieerig () wwwijeasorg

6 The Nature Diagosability of Bubble-sort Star Graphs uder the PMC Model ad MM* Model [4] Zheg J Latifi S Regetova E Luo K Wu X Diagosability of star graphs uder the compariso diagosis model Iformatio Processig Letters 93 () [5] Li C-K Ta JJM Hsu L-H Cheg E Liptàk L Coditioal Diagosability of Cayley Graphs Geerated by Traspositio Trees uder the Compariso Diagosis Model Joural of Itercoectio Networks 9 (-) [6] Body JA Murty USR Graph Theory Spriger New York 007 [7] Hsieh S-Y Kao C-Y The coditioal diagosability of k-ary -ubes uder the compariso diagosis model IEEE Trasactios o Computers 6 (4) [8] Zhou S Wag J Xu X Xu J-M Coditioal fault diagosis of bubble sort graphs uder the PMC model Itelligece Computatio ad Evolutioary Computatio [9] Cai H Liu H Lu M Fault-tolerat maximal local-coectivity o Bubble-sort star graphs Discrete Applied Mathematics [30] Guo J Lu M Coditioal diagosability of bubble-sort star graphs Discrete Applied Mathematics 0() [3] Wag M Yag W Guo Y Wag S Coditioal Fault Tolerace i a Class of Cayley Graphs Iteratioal Joural of Computer Mathematics 3 () wwwijeasorg

Fault-Free Vertex-Pancyclicity in Twisted Cubes with Faulty Edges

Fault-Free Vertex-Pancyclicity in Twisted Cubes with Faulty Edges Fault-Free Verte-Pacclicit i Twisted Cubes with Fault Edges Jug-Sheg Fu Abstract The -dimesioal twisted cube deoted b a variatio of the hpercube possesses some properties superior to the hpercube. I this

More information

CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS

CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 22 CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 2.1 INTRODUCTION Various types of domiatio have bee studied by several authors ad more tha 75 models of domiatio are listed i the appedix

More information

γ-max Labelings of Graphs

γ-max Labelings of Graphs γ-max Labeligs of Graphs Supapor Saduakdee 1 & Varaoot Khemmai 1 Departmet of Mathematics, Sriakhariwirot Uiversity, Bagkok, Thailad Joural of Mathematics Research; Vol. 9, No. 1; February 017 ISSN 1916-9795

More information

BI-INDUCED SUBGRAPHS AND STABILITY NUMBER *

BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,

More information

Alliance Partition Number in Graphs

Alliance Partition Number in Graphs Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval

More information

Weakly Connected Closed Geodetic Numbers of Graphs

Weakly Connected Closed Geodetic Numbers of Graphs Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda

More information

Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model

Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model Hybrid Fault diagnosis capability analysis of Hypercubes under the PMC model and MM model Qiang Zhu,Lili Li, Sanyang Liu, Xing Zhang arxiv:1709.05588v1 [cs.dc] 17 Sep 017 Abstract System level diagnosis

More information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

More information

Absolutely Harmonious Labeling of Graphs

Absolutely Harmonious Labeling of Graphs Iteratioal J.Math. Combi. Vol. (011), 40-51 Absolutely Harmoious Labelig of Graphs M.Seeivasa (Sri Paramakalyai College, Alwarkurichi-6741, Idia) A.Lourdusamy (St.Xavier s College (Autoomous), Palayamkottai,

More information

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

AN INTRODUCTION TO SPECTRAL GRAPH THEORY

AN INTRODUCTION TO SPECTRAL GRAPH THEORY AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus

More information

ON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO. Lingling Zhou, Bo Zhou* and Zhibin Du 1. INTRODUCTION

ON THE NUMBER OF LAPLACIAN EIGENVALUES OF TREES SMALLER THAN TWO. Lingling Zhou, Bo Zhou* and Zhibin Du 1. INTRODUCTION TAIWANESE JOURNAL OF MATHEMATICS Vol 19, No 1, pp 65-75, February 015 DOI: 1011650/tjm190154411 This paper is available olie at http://jouraltaiwamathsocorgtw ON THE NUMBER OF LAPLACIAN EIGENVALUES OF

More information

EQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS. Sethu Institute of Technology Kariapatti, Tamilnadu, INDIA 2 Department of Mathematics

EQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS. Sethu Institute of Technology Kariapatti, Tamilnadu, INDIA 2 Department of Mathematics Iteratioal Joural of Pure ad Applied Mathematics Volume 104 No. 2 2015, 193-202 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v104i2.4

More information

Disjoint unions of complete graphs characterized by their Laplacian spectrum

Disjoint unions of complete graphs characterized by their Laplacian spectrum Electroic Joural of Liear Algebra Volume 18 Volume 18 (009) Article 56 009 Disjoit uios of complete graphs characterized by their Laplacia spectrum Romai Boulet boulet@uiv-tlse.fr Follow this ad additioal

More information

Large holes in quasi-random graphs

Large holes in quasi-random graphs Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,

More information

ADVANCES in the semiconductor technology have made

ADVANCES in the semiconductor technology have made IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO. 4, APRIL 015 1165 The g-good-neighbor Coditioal Diagosability of k-ary -Cubes uder the PMC Model ad MM Model Ju Yua, Aixia Liu, Xue Ma,

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix

Math 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),

More information

The average-shadowing property and topological ergodicity

The average-shadowing property and topological ergodicity Joural of Computatioal ad Applied Mathematics 206 (2007) 796 800 www.elsevier.com/locate/cam The average-shadowig property ad topological ergodicity Rogbao Gu School of Fiace, Najig Uiversity of Fiace

More information

Adjacent vertex distinguishing total coloring of tensor product of graphs

Adjacent vertex distinguishing total coloring of tensor product of graphs America Iteratioal Joural of Available olie at http://wwwiasiret Research i Sciece Techology Egieerig & Mathematics ISSN Prit): 38-3491 ISSN Olie): 38-3580 ISSN CD-ROM): 38-369 AIJRSTEM is a refereed idexed

More information

Formulas for the Number of Spanning Trees in a Maximal Planar Map

Formulas for the Number of Spanning Trees in a Maximal Planar Map Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces

More information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

On Topologically Finite Spaces

On Topologically Finite Spaces saqartvelos mecierebata erovuli aademiis moambe, t 9, #, 05 BULLETIN OF THE GEORGIAN NATIONAL ACADEMY OF SCIENCES, vol 9, o, 05 Mathematics O Topologically Fiite Spaces Giorgi Vardosaidze St Adrew the

More information

REVIEW FOR CHAPTER 1

REVIEW FOR CHAPTER 1 REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)

More information

Disjoint Systems. Abstract

Disjoint Systems. Abstract Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Bi-Magic labeling of Interval valued Fuzzy Graph

Bi-Magic labeling of Interval valued Fuzzy Graph Advaces i Fuzzy Mathematics. ISSN 0973-533X Volume 1, Number 3 (017), pp. 645-656 Research Idia Publicatios http://www.ripublicatio.com Bi-Magic labelig of Iterval valued Fuzzy Graph K.Ameeal Bibi 1 ad

More information

The Local Harmonious Chromatic Problem

The Local Harmonious Chromatic Problem The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Ma/CS 6b Class 19: Extremal Graph Theory

Ma/CS 6b Class 19: Extremal Graph Theory /9/05 Ma/CS 6b Class 9: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that

More information

On Net-Regular Signed Graphs

On Net-Regular Signed Graphs Iteratioal J.Math. Combi. Vol.1(2016), 57-64 O Net-Regular Siged Graphs Nuta G.Nayak Departmet of Mathematics ad Statistics S. S. Dempo College of Commerce ad Ecoomics, Goa, Idia E-mail: ayakuta@yahoo.com

More information

Pairs of disjoint q-element subsets far from each other

Pairs of disjoint q-element subsets far from each other Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd

More information

The Choquet Integral with Respect to Fuzzy-Valued Set Functions

The Choquet Integral with Respect to Fuzzy-Valued Set Functions The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Properties of Fuzzy Length on Fuzzy Set

Properties of Fuzzy Length on Fuzzy Set Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,

More information

Dominating Sets and Domination Polynomials of Square Of Cycles

Dominating Sets and Domination Polynomials of Square Of Cycles IOSR Joural of Mathematics IOSR-JM) ISSN: 78-78. Volume 3, Issue 4 Sep-Oct. 01), PP 04-14 www.iosrjourals.org Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat

More information

ON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv: v1 [math.co] 2 Jan 2019

ON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv: v1 [math.co] 2 Jan 2019 ON RADIO NUMBER OF STACKED-BOOK GRAPHS arxiv:1901.00355v1 [math.co] Ja 019 TAYO CHARLES ADEFOKUN 1 AND DEBORAH OLAYIDE AJAYI Abstract. A Stacked-book graph G m, results from the Cartesia product of a stargraphs

More information

page Suppose that S 0, 1 1, 2.

page Suppose that S 0, 1 1, 2. page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The

More information

Lecture 14: Graph Entropy

Lecture 14: Graph Entropy 15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

RADIO NUMBER FOR CROSS PRODUCT P n (P 2 ) Gyeongsang National University Jinju, , KOREA 2,4 Department of Mathematics

RADIO NUMBER FOR CROSS PRODUCT P n (P 2 ) Gyeongsang National University Jinju, , KOREA 2,4 Department of Mathematics Iteratioal Joural of Pure ad Applied Mathematics Volume 97 No. 4 014, 515-55 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v97i4.11

More information

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.)

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.) Sets 1 Math 3312 Set Theory Sprig 2008 Itroductio Set theory is a brach of mathematics that deals with the properties of welldefied collectios of objects, which may or may ot be of a mathematical ature,

More information

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf. Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.

More information

Lecture 2. The Lovász Local Lemma

Lecture 2. The Lovász Local Lemma Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio

More information

Research Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property

Research Article A Note on Ergodicity of Systems with the Asymptotic Average Shadowing Property Discrete Dyamics i Nature ad Society Volume 2011, Article ID 360583, 6 pages doi:10.1155/2011/360583 Research Article A Note o Ergodicity of Systems with the Asymptotic Average Shadowig Property Risog

More information

A class of spectral bounds for Max k-cut

A class of spectral bounds for Max k-cut A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Research Article On the Strong Laws for Weighted Sums of ρ -Mixing Random Variables

Research Article On the Strong Laws for Weighted Sums of ρ -Mixing Random Variables Hidawi Publishig Corporatio Joural of Iequalities ad Applicatios Volume 2011, Article ID 157816, 8 pages doi:10.1155/2011/157816 Research Article O the Strog Laws for Weighted Sums of ρ -Mixig Radom Variables

More information

ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS

ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS A.Maheswari 1, P.Padiaraj 2 1,2 Departet of Matheatics,Kaaraj College of Egieerig ad Techology, Virudhuagar (Idia) ABSTRACT A graph G

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit

More information

Lecture XVI - Lifting of paths and homotopies

Lecture XVI - Lifting of paths and homotopies Lecture XVI - Liftig of paths ad homotopies I the last lecture we discussed the liftig problem ad proved that the lift if it exists is uiquely determied by its value at oe poit. I this lecture we shall

More information

A Study on Total Rebellion Number in Graphs

A Study on Total Rebellion Number in Graphs Joural of Iformatics ad Mathematical Scieces Vol. 9, No. 3, pp. 765 773, 017 ISSN 0975-5748 (olie); 0974-875X (prit) Published by GN Publicatios http://www.rgpublicatios.com Proceedigs of the Coferece

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

University of Twente The Netherlands

University of Twente The Netherlands Faculty of Mathematical Scieces t Uiversity of Twete The Netherlads P.O. Box 7 7500 AE Eschede The Netherlads Phoe: +3-53-4893400 Fax: +3-53-48934 Email: memo@math.utwete.l www.math.utwete.l/publicatios

More information

PAijpam.eu IRREGULAR SET COLORINGS OF GRAPHS

PAijpam.eu IRREGULAR SET COLORINGS OF GRAPHS Iteratioal Joural of Pure ad Applied Mathematics Volume 109 No. 7 016, 143-150 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: 10.173/ijpam.v109i7.18 PAijpam.eu

More information

Weight Distribution in Matching Games

Weight Distribution in Matching Games Faculty of Electrical Egieerig, Mathematics & Computer Sciece Weight Distributio i Matchig Games Frits Hof Idividual research assigmet for course program Oderzoek va wiskude i master Sciece Educatio ad

More information

FIXED POINTS OF n-valued MULTIMAPS OF THE CIRCLE

FIXED POINTS OF n-valued MULTIMAPS OF THE CIRCLE FIXED POINTS OF -VALUED MULTIMAPS OF THE CIRCLE Robert F. Brow Departmet of Mathematics Uiversity of Califoria Los Ageles, CA 90095-1555 e-mail: rfb@math.ucla.edu November 15, 2005 Abstract A multifuctio

More information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients Proof of a cojecture of Amdeberha ad Moll o a divisibility property of biomial coefficiets Qua-Hui Yag School of Mathematics ad Statistics Najig Uiversity of Iformatio Sciece ad Techology Najig, PR Chia

More information

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

Math778P Homework 2 Solution

Math778P Homework 2 Solution Math778P Homework Solutio Choose ay 5 problems to solve. 1. Let S = X i where X 1,..., X are idepedet uiform { 1, 1} radom variables. Prove that E( S = 1 ( 1 1 Proof by Day Rorabaugh: Let S = X i where

More information

The Forcing Domination Number of Hamiltonian Cubic Graphs

The Forcing Domination Number of Hamiltonian Cubic Graphs Iteratioal J.Math. Combi. Vol.2 2009), 53-57 The Forcig Domiatio Number of Hamiltoia Cubic Graphs H.Abdollahzadeh Ahagar Departmet of Mathematics, Uiversity of Mysore, Maasagagotri, Mysore- 570006 Pushpalatha

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Rank Modulation with Multiplicity

Rank Modulation with Multiplicity Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order

More information

THIS paper analyzes the behavior of those complex

THIS paper analyzes the behavior of those complex IAENG Iteratioal Joural of Computer Sciece 39:4 IJCS_39_4_6 Itrisic Order Lexicographic Order Vector Order ad Hammig Weight Luis Gozález Abstract To compare biary -tuple probabilities with o eed to compute

More information

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

Exercises Advanced Data Mining: Solutions

Exercises Advanced Data Mining: Solutions Exercises Advaced Data Miig: Solutios Exercise 1 Cosider the followig directed idepedece graph. 5 8 9 a) Give the factorizatio of P (X 1, X 2,..., X 9 ) correspodig to this idepedece graph. P (X) = 9 P

More information

ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES. 1 Introduction

ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES. 1 Introduction Appl. Math. J. Chiese Uiv. Ser. B 2007, 22(4): 478-484 ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES Wag Yi 1 Fa Yizheg 1 Ta Yigyig 1,2 Abstract. I this paper, a equivalet coditio of a graph G with

More information

Few remarks on Ramsey-Turán-type problems Benny Sudakov Λ Abstract Let H be a fixed forbidden graph and let f be a function of n. Denote by RT n; H; f

Few remarks on Ramsey-Turán-type problems Benny Sudakov Λ Abstract Let H be a fixed forbidden graph and let f be a function of n. Denote by RT n; H; f Few remarks o Ramsey-Turá-type problems Bey Sudakov Abstract Let H be a fixed forbidde graph ad let f be a fuctio of. Deote by ; H; f () the maximum umber of edges a graph G o vertices ca have without

More information

Seed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers

Seed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-75X. Volume 1, Issue 5 Ver. VIII (Sep. - Oct.01), PP 01-07 www.iosrjourals.org Seed ad Sieve of Odd Composite Numbers with Applicatios i

More information

Davenport-Schinzel Sequences and their Geometric Applications

Davenport-Schinzel Sequences and their Geometric Applications Advaced Computatioal Geometry Sprig 2004 Daveport-Schizel Sequeces ad their Geometric Applicatios Prof. Joseph Mitchell Scribe: Mohit Gupta 1 Overview I this lecture, we itroduce the cocept of Daveport-Schizel

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

How to Maximize a Function without Really Trying

How to Maximize a Function without Really Trying How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Some Results on Tenacity of Graphs

Some Results on Tenacity of Graphs WSEAS TRANSACTIONS o MATHEMATICS Fegwei Li Some Results o Teacity of Graphs Fegwei Li Shaoig Uiversity Departmet of mathematics Shaoig, Zhejiag 31000 P R Chia fegweili@eyoucom Abstract: The teacity of

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

Solutions for the Exam 9 January 2012

Solutions for the Exam 9 January 2012 Mastermath ad LNMB Course: Discrete Optimizatio Solutios for the Exam 9 Jauary 2012 Utrecht Uiversity, Educatorium, 15:15 18:15 The examiatio lasts 3 hours. Gradig will be doe before Jauary 23, 2012. Studets

More information

Parallel Vector Algorithms David A. Padua

Parallel Vector Algorithms David A. Padua Parallel Vector Algorithms 1 of 32 Itroductio Next, we study several algorithms where parallelism ca be easily expressed i terms of array operatios. We will use Fortra 90 to represet these algorithms.

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

Chain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1

Chain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1 CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,

More information

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES LE MATEMATICHE Vol. LXXIII 208 Fasc. I, pp. 3 24 doi: 0.448/208.73.. EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES THOMAS ERNST We preset idetities of various kids for

More information

Balanced coloring of bipartite graphs

Balanced coloring of bipartite graphs Balaced colorig of bipartite graphs Uriel Feige Shimo Koga Departmet of Computer Sciece ad Applied Mathematics Weizma Istitute, Rehovot 76100, Israel uriel.feige@weizma.ac.il Jue 16, 009 Abstract Give

More information

Analysis of Supportable Rates in Symmetric Blocking Wavelength Routers

Analysis of Supportable Rates in Symmetric Blocking Wavelength Routers Aalysis of Supportable Rates i Symmetric Blockig Wavelegth Routers Ca Emre Koksal EPFL School of Computer ad Commuicatio Scieces Lausae, Switzerlad E-mail: emrekoksal@epflch Abstract Costructig a o-blockig

More information

Model Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions

Model Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical,

More information

UPPER AND LOWER BOUNDS OF THE BASIS NUMBER OF KRONECKER PRODUCT OF A WHEEL WITH A PATH AND A CYCLE

UPPER AND LOWER BOUNDS OF THE BASIS NUMBER OF KRONECKER PRODUCT OF A WHEEL WITH A PATH AND A CYCLE J.Edu. Sci, Vol. (9) No.(2) 2007 UPPER AND LOWER BOUNDS OF THE BASIS NUMBER OF KRONECKER PRODUCT OF A WHEEL WITH A PATH AND A CYCLE Ghassa T. Marougi Ayha A. Khalil Dept. Math./College of Computers & Mathematics

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

SPANNING SIMPLICIAL COMPLEXES OF n-cyclic GRAPHS WITH A COMMON EDGE. Guangjun Zhu, Feng Shi and Yuxian Geng

SPANNING SIMPLICIAL COMPLEXES OF n-cyclic GRAPHS WITH A COMMON EDGE. Guangjun Zhu, Feng Shi and Yuxian Geng Iteratioal Electroic Joural of Algera Volume 15 2014 132-144 SPANNING SIMPLICIAL COMPLEXES OF -CYCLIC GRAPHS WITH A COMMON EDGE Guagju Zhu, Feg Shi ad Yuxia Geg Received: 1 August 2013; Revised: 5 Novemer

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

Inequalities for Entropies of Sets of Subsets of Random Variables

Inequalities for Entropies of Sets of Subsets of Random Variables Iequalities for Etropies of Sets of Subsets of Radom Variables Chao Tia AT&T Labs-Research Florham Par, NJ 0792, USA. tia@research.att.com Abstract Ha s iequality o the etropy rates of subsets of radom

More information

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Binary codes from graphs on triples and permutation decoding

Binary codes from graphs on triples and permutation decoding Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics

More information

A Survey on Monochromatic Connections of Graphs

A Survey on Monochromatic Connections of Graphs Theory ad Applicatios of Graphs Special Issue: Dyamic Surveys Article 4 018 A Survey o Moochromatic Coectios of Graphs Xueliag Li Nakai Uiversity, lxl@akai.edu.c Di Wu Nakai Uiversity, wudiol@mail.akai.edu.c

More information

Application to Random Graphs

Application to Random Graphs A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let

More information

Unsaturated Solutions of A Nonlinear Delay Partial Difference. Equation with Variable Coefficients

Unsaturated Solutions of A Nonlinear Delay Partial Difference. Equation with Variable Coefficients Europea Joural of Mathematics ad Computer Sciece Vol. 5 No. 1 18 ISSN 59-9951 Usaturated Solutios of A Noliear Delay Partial Differece Euatio with Variable Coefficiets Xiagyu Zhu Yuahog Tao* Departmet

More information