Covering planar graphs with degree bounded forests
|
|
- Lorin Gilbert
- 8 years ago
- Views:
Transcription
1 Coering planar graphs ith degree bonded forests D. Gonçales LaBRI, U.M.R. 5800, Uniersité Bordea 1, 351 cors de la Libération alence Cede, France. Abstract We proe that eer planar graphs has an edge partition into three forests, one haing maimm degree 4. his ansers a conjectre of Balogh et al. (J. Combin. heor B. 94 (2005) ).We also proe that eer planar graphs ith girth g 6 (resp. g 7) has an edge partition into to forests, one haing maimm degree 4 (resp. 2). Ke ords: planar graphs, edge partition, forests, trees 1 Introdction A graph G is coered b sbgraphs G 1,...,G k of G if eer edge of G belongs to one of these sbgraphs. A graph G is (t, D)-coerable if it can be coered b t forests and a graph H of maimm degree (H) D. A graph is F(d 1,...,d k )-coerable if it can be coered b k forests F 1,...,F k sch that (F i ) d i for all 1 i k. If d i = the maimm degree of F i is nbonded. B a reslt of Nash-Williams [8], e kno that planar graphs are (3, 0)-coerable (i.e. F(,, )-coerable) and that planar graphs of girth g 4 are (2, 0)-coerable (i.e. F(, )-coerable). In [6], the athors proed that planar graphs are (2, 8)-coerable. he athors also asked hat cold be the minimal d sch that eer planar graph is (2, d)-coerable. In [2], the athors proed that planar graphs are more than (2, 8)-coerable, the are F(,, 8)-coerable. he also proed that there eist non-(2, 3)-coerable planar graphs and the conjectred that planar graphs are (2, 4)-coerable. Or main reslt is slightl stronger than this conjectre. address: goncale@labri.fr (D. Gonçales). Preprint sbmitted to Jornal of Combinatorial heor, Series B
2 l r e Fig. 1. From to e, l and r. heorem 1 Planar graphs are F(,, 4)-coerable. he case of bonded girth planar graphs has also been stdied. It is proen in [6] that planar graphs ith girth at least 5 (resp. 7) are (1, 4)-coerable (resp.(1, 2)-coerable). In [1], the athors proed that planar graphs ith girth at least 10 are (1, 1)-coerable (i.e. F(, 1)-coerable). Here e hae some reslts on forest coerings of planar graphs of girth at least 6 or 7. heorem 2 Planar graphs of girth g 6 are F(, 4)-coerable. heorem 3 Planar graphs of girth g 7 are F(, 2)-coerable. 2 Planar graphs A trianglation is a planar graph in hich eer face is trianglar. In [4] the athor proed that planar graphs are coerable b for forests of caterpillars. His proof orks b indction sing a decomposition of trianglations into three smaller trianglations. We proe heorem 1 sing the same decomposition tool. Consider an embedded trianglation ith at least for ertices and sch that going conter-clockise on the eternal face e sccessiel meet the ertices, and. For a cople (, ) of these ertices e define its partner cople (, ) of ertices. In a trianglation ith at least for ertices, an edge ab is sch that its ends, a and b, hae at least to common neighbors. We consider the seqence of s neighbors going in the clockise sense from to. Let be the second of these ertices being a neighbor of (the first one being, ). Note that eer common neighbor of and other than or is inside the ccle (,, ). hen, let be the first erte of the seqence that is a neighbor of. Since and hae at least to common neighbors, one of these ertices appears before in the seqence, so. On the other hand note that the erte ma be eqal to. Note that partner coples are defined for eer trianglation K 3. 2
3 e m Fig. 2. From e to m. Let l (resp. r ) be the trianglation indced b the ertices on and inside the ccle (,, ) (resp. (,, )). hen let e be the trianglation indced b the ertices on and otside the ccle (,,, ) (see Figre 1). Since / V ( r ) and / V ( l ), r and l hae less ertices than. his is not the case for e if (,, ) and (,, ) both delimit an inner-face of. In e, the ertices and (resp. and ) hae onl to common neighbors, and (resp. and ). So in e, the partner cople of (, ) is still (, ). We constrct m from e b deleting three edges,, and, and then merging and in a single erte (see Figre 2). Since and hae onl to common neighbors and in e, m is a ell defined trianglation, ithot loop or mltiple edges. Since e merged to ertices, m has less ertices than e. If m K 3, let (, ) be the partner cople of (, ) in m. Note that since and hae eactl to neighbors in e, and, the erte is adjacent to and not adjacent to in e. Using this decomposition, e proe the folloing theorem illstrated in Figre 3. heorem 4 Gien an trianglation = (V, E) and an triplet (,, ) of ertices on the eternal face, let (, ) be the partner cople of (, ). he graph = \{,, } has an F(,, 4)-coering b F 1, F 2 and F 3. If is defined, this is if K 3 these forests are sch that : - the edges of incident to are in F 1, - the edges of incident to are in F 2, - the edge is in F 3, - the edges of incident to strictl beteen and are in F 1, - the edges of incident to strictl beteen and are in F 2, and - the ertices, and are in distinct connected components of F i, for 1 i 3. Frthermore, the connected component of F 2 containing the erte onl contains and some ertices inside the ccle (,, ). Note that each of these forests has eactl 3 connected components. Indeed, an acclic graph on n ertices ith c connected components has n c edges and the graph has 3n 9 edges. For eample the forest F 2 has 2 connected 3
4 F F F Fig. 3. he edge partition of heorem 1. components of one erte each, respectiel and, and a third connected component containing all the remaining ertices. We can etend this edgepartition of to b ptting for eample the edges and in F 1 and the edge in F 2. his partition clearl implies heorem 1. PROOF. his proof orks b indction on V (). he theorem clearl holds for K 3, so e consider the indction step of the proof. Gien a trianglation ith V () 4, consider the three trianglations m, l and r obtained b the decomposition of described before. Since m, l and r hae less ertices than, e can se the indction hpothesis. Let F 1, F 2 and F 3 be the three forests gien b the theorem for the trianglation m and the triplet (,, ). hese forests coer m = m \ {,, } and e se them to define the graphs F 1, F 2 and F 3 that coer e = e \ {,, }. - F i \ {, } F i - a F i if a and a F i - a F i if a, or, and a F i - F 1 - F 2 - F 3 hese forests erif the conditions of the theorem for the trianglation e and the triplet (,, ). - he edges incident to, or are clearl ell partitionned. - he graph F 1 is a forest. If F 1 had a ccle, this ccle shold either pass throgh or not. In the first case, this old impl that there is a path from to in F 1 m. In the second case, this old impl that there is a ccle in F 1 m. Both cases are impossible since the partition of m erifies the theorem. Similarl the ertices, and are in distinct connected components of F 1. If there as a path in F 1 linking to of these ertices this path shold either pass throgh or not. In the first case, this old impl that there is either a path from to or a ccle (passing throgh ) in F 1 m. In 4
5 e m Fig. 4. From m to e. the second case, this old impl that there is a path in F 1 m linking to of the ertices, or. Both cases are impossible since the partition of m erifies the theorem. - he graph F 2 is a forest. If F 2 had a ccle, this ccle shold either pass throgh or not. In the first case, this old impl that there is a path from to in F 2 m. In the second case, this old impl that there is a ccle in F 2 m. Both cases are impossible since the partition of m erifies the theorem. Similarl the ertices, and are in distinct connected components of F 2. If there as a path in F 2 linking to of these ertices this path shold either pass throgh or not. In the first case, this old impl that there is either a path from to or, or a ccle (passing throgh ) in F 2 m. In the second case, this old impl that there is a path in F 2 m linking to of the ertices, or. Both cases are impossible since the partition of m erifies the theorem. Frthermore, since there is no erte inside (,, ) and no edge incident to in F 2, the connected component of F 2 containing is as epected. - he graph F 3 is a forest. If F 3 had a ccle, this ccle shold either pass throgh or not. In the first case, this old impl that there is a ccle (passing throgh ) in F 3 m. In the second case, this old impl that there is a ccle in F 3 m. Both cases are impossible since the partition of m erifies the theorem. Similarl the ertices, and are in distinct connected components of F 3. If there as a path in F 3 linking to of these ertices this path shold either pass throgh or not. In the first case, this old impl that there is a path from to or in F 3 m. In the second case, this old impl that there is a path in F 3 m linking to of the ertices, or. Both cases are impossible since the partition of m erifies the theorem. Frthermore note that eer erte a V ( e ) \ {, } has as man incident edges in F 3 as in F 3. Since and hae respectiel one and to incident edges in F 3, F 3 has maimm degree at most for. For the rest of the proof it is important to remember that the theorem holds 5
6 l r e Fig. 5. From e, l and r to. for e in sch a that has degree to in F 3. he graph is the disjoint nion of e, l = l \{,, }, and r = r \{,, }. We constrct an edge-partition of into three forest F 1, F 2, and F 3, b partitionning each of e, l, and r into three forests. o do this, e appl the indction hpothesis to l according to the triplet (,, ). his means that the edges incident to (resp. ) in l belongs to F 1 (resp. F 2 ). Similarl, e appl the indction hpothesis to r according to the triplet (,, ). his means that the edges incident to (resp. ) in l belongs to F 1 (resp. F 2 ). We hae seen that the indction hpothesis holds for e according to the triplet (,, ), and e consider sch partition in hich the erte has degree to in F 3. his elds to a partition of into the three forests described in the theorem. - he edges incident to, or are clearl ell partitionned. - he graph F i, for an 1 i 3, is a forest. If F i old contain a ccle, since there is no sch ccle in e, l, or r, this ccle shold pass throgh l or r. his old impl that there is a path in F i l or F i r linking to of the ertices,,, and, hich is impossible according to the partitions of l or r. - he graph F i, for an 1 i 3, does not contain an path linking to of the ertices,, and. If F i old contain sch path, since there is no sch path in e, this path shold pass throgh l or r from to, or, or from to, hich is impossible according to the partitions of l or r. - Since the erte has no incident edges in F 2 e and F 2 r, and since there is no path from to or in F 2 l, the connected component of F 2 containing onl contains ans some ertices inside (,, ). - he graph F 3 is sch that, (F 3 ) 4. Indeed, has at most 2, 1, and 1 incident edges in F 2 e, F 2 l, and F 2 r ; and the other ertices hae as man incident edges in F 2 as in F 2 e, F 2 l, or F 2 r. his complete the proof of the theorem. 6
7 3 Planar graphs of bonded girth he reslts in [1, 2, 5, 6] are all proed sing discharging methods. We se this method for proing heorem 2 and heorem 3. his method consists roghl in shoing that a conter-eample H minimizing V (H) old be too dense (i.e. has too man edges per erte) to erif Eler s Formla. his formla sas that an connected planar graph G ith n ertices, m edges and f faces erifies m = n + f 2. Let s define a k-erte (resp. k-erte and k-erte) as a erte of degree k (resp. at most k and at least k). 3.1 Planar graphs ith girth g 6 Let H be a conter-eample of heorem 2 minimizing V (H). Lemma 5 he conter-eample H: (1) is connected, (2) has minimm degree δ(h) 2, and (3) does not contain an edge sch that deg() = 2 and deg() 5. PROOF. (1) If H as disconnected, one of its connected component old be a smaller conter-eample. (2) If H had a 1-erte, the graph H \ {} old hae girth g 6 and old hae an F(, 4)-coering b F 1 and F 2. Adding the incident edge of in F 1 e old obtain an F(, 4)-coering of H, hich is impossible. (3) Consider that H had an edge sch that deg() = 2 and deg() 5. Since H is minimal, the graph H\{} has an F(, 4)-coering b F 1 and F 2. We etend those forests to obtain an F(, 4)-coering of H. Let be the second neighbor of. If all the edges incident to in H\{} are in F 2 then let F 1 = F 1 {, } and F 2 = F 2. Else, has degree at most 3 in F 2 and let F 1 = F 1 {} and F 2 = F 2 {}. In both cases the forests F 1 and F 2 coer H, and (F 2) 4. Since H is not F(, 4)-coerable e hae a contradiction and H does not contain sch edge. We no se a discharging procedre on the ertices of H in order to estimate 2 E(H) / V (H). Let the intitial charge of the ertices be eqal to their degree, ch() = deg() for all V (H). hen, eer 6-erte gies charge 1 to its 2 neigbhors of degree 2. After this procedre the total charge of the graph is presered and all the ertices hae a final charge ch () 3. Indeed : If deg() = 2, then receies 1 2 and ch () = = 3. 2 from each of its neighbors (Lemma 5.(3)) 7
8 If 3 deg() 5, then does not gie an charge, so ch () 3. If 6 deg(), then gies at most 1 2 to each of its neigbors, so ch () = 3. So e hae that 2 E(H) = V (H) deg() = V (H) ch () 3 V (H). Let n, m and f denote respectiel the nmber of ertices, edges and faces in H. We kno that 2m 3n and since H has girth at least 6, each face is bonded b at least 6 edges and 2m 6f. Combining these to eqations e obtain that m n + f contradicting Eler s Formla. So H does not eist and heorem 2 holds. 3.2 Planar graphs ith girth g 7 Let H be a conter-eample of heorem 3 minimizing V (H). Lemma 6 he conter-eample H: (1) is connected, (2) has minimm degree δ(h) 2, (3) does not contain an edge sch that deg() = 2 and deg() 3, and (4) does not contain an 3-erte adjacent to three 3-ertices. PROOF. (1) If H as disconnected, one of its connected component old be a smaller conter-eample. (2) If H had a 1-erte, the graph H \ {} old hae girth g 6 and old hae an F(, 4)-coering b F 1 and F 2. Adding the incident edge of in F 1 e old obtain an F(, 4)-coering of H, hich is impossible. For the cases (3) and (4) e consider the graph H\{}. B minimalit of V (H), the graph H\{} has an F(, 4)-coering b F 1 and F 2. We consider a pair (F 1, F 2 ) maimizing the nmber of edges in F 1. his implies that eer 2-erte in H\{} has at most one incident edge in F 2. In case (3), let be the second neighbor of. Since has degree at most one in F 2, the forests F 1 {} and F 2 {} old be an F(, 4)-coering of H, hich is impossible. In case (4), let 1, 2 and 3 be the neighbors of. Since 1, 2 and 3 hae degree at most to in H\{}, the hae degree at most one in F 2. Since each connected component of F 2 contains at most to 1-ertices, to of the ertices 1, 2 and 3 are in distinct connected components of F 2, sa 1 and 2. In this case, the forests F 1 { 3 } and F 2 { 1, 2 } old be an F(, 4)-coering of H, hich is impossible. Since δ(h) 2, e distingish 6 tpes of edges in H : 8
9 (a) For eer 2-erte, let one of its incident edges be an a-edge and the other one be an a-edge. Let s distingish 2 tpes of 3-ertices. An isolated 3-erte has no 3-erte in its neighborhood. he rest of the 3-ertices are linked 3-ertices, this means adjacent to at least one 3-erte. (b) For eer isolated 3-erte, let one of its incident edges be a b-edge and the to remaining ones be b-edges. (c) We consider the sbgraph K of H indced b the linked 3-ertices. his sbgraph K is sch that (K) 2 (b Lemma 6.(4)) and δ(k) 1 (b definition of linked 3-ertices). Let C E(K) be the smallest set of edges in K sch that all the linked 3-ertices hae an incident edge in C. he minimalit of C implies that in each connected component of K (a ccle or a path), there is at most one erte ith to incident edges in C. he edges of C are the c-edges and all the edges of H (not jst K) adjacent to a c-edge are c-edges. It is clear gien Lemma 6 that the sets of a-, b-, c-, a-, b- and c-edges, respectiel A, B, C, A, B and C, are pairise disjoint. No e transform H into another graph H b contracting the a-, b- and c-edges. Since eer 2-erte (resp. 3-erte) is adjacent to a 4-erte (resp. 3-erte) b an a-edge (resp. b- or c-edge), and since it has at most one (resp. to) incident a-edge (resp. b- or c-edges), there is no more ertices of degree less than 4 in H. Lemma 7 he graph H is connected and after the transformation eer ccle C in H becomes a ccle C in H. (1) If C has length 7 and if all its ertices are 3-ertices, then the ccle C has length 3 and contains a 5-erte. (2) Else, the ccle C has length l(c ) 4. PROOF. It is clear that, b contracting edges, a graph remains connected. For the ccles e distingish the to cases. In case (1), since C has 4 c- edges and 3 c-edges, the ccle C has length 3 and the to consectie c-edges prodce a 5-erte. In case (2), the ccle C contains at least one 4-erte (case (2.1)) or contains onl 3-ertices and has length l 8 (case(2.2)). In case (2.1), consider an path P = ( 0, 1,..., k ) C linking to 4- ertices, 0 and k, and going throgh 3-ertices. Actall this path ma be a ccle if 0 = k. Claim 8 here is at least as man a-edges (resp. b-edges and c-edges) in P than a-edges (resp. b-edges and c-edges). 9
10 Indeed : (-) If P is jst an edge linking to 4-ertices, then this edge is not an a-, b- or c-edge. (a) If P goes throgh a 2-erte, then P has length 2 and contains eactl one a-edge and one a-edge. (b) If P goes throgh an isolated 3-erte, then P has length 2 and contains at most one b-edge and at least one b-edge. (c) If P goes throgh (k 1) 3-ertices, then P contains k 1 c-edges and the remaining k k 1 2 edges are c-edges. his claim implies that at most half of the edges in C are contracted. Since l(c) 7 this implies that C has length l 4. In case (2.2), the ccle C has length l 8 and contains l 2 c-edges and the remaining l 2 edges are c-edges Since l 2 4 hen l 8, e hae l(c ) 4 and the lemma holds. 2 Let n 4 and n 5 be the nmber of 4-ertices and 5-ertices in H. Let c 3 be the nmber of ccles of length 3 in H. Note that all the ccles of length 3 in H contain a 5-erte. Since these ccles of length 3 in H come from ccles of 3-ertices in H, Lemma 6.(4) implies that these ccles of length 3 are erte disjoint. his implies that n 5 c 3. Let f 3 and f 4 be the nmber of faces of length respectiel l = 3 and l 4 in H. Since c 3 f 3, e hae n 5 f 3. No, let n, m and f be the nmber of ertices, edges and faces in H. It is clear that n = n 4 +n 5 and f = f 3 +f 4. Since the edges hae to end points and are incident to at most to faces, e hae : 2m 4n 4 + 5n 5 = 4n + n 5 4n + f 3 2m 3f 3 + 4f 4 = 4f f 3 Sming these to eqations e obtain that m n + f contradicting Eler s Formla. So H and H do not eist and heorem 3 holds. 4 Perspecties In [3] Colin de Verdière introdced a graph parameter µ. For a graph G this parameter is defined b spectral properties of matrices associated to G. his parameter is sch that : - µ(g) 1 iff G is a forest of paths. - µ(g) 2 iff G is an oterplanar graph. 10
11 - µ(g) 3 iff G is a planar graph. Since forests of paths, oterplanar graphs [2], and planar graphs are respectiel F(2)-, F(, 3)-, and F(,, 4)-coerable e conjectre the folloing. Conjectre 9 Eer graph G has an edge partition into µ(g) forests, one haing maimm degree µ(g) + 1. A eaker reslt old be that eer graph G is (µ(g) 1, µ(g)+1)-coerable. his reslt old be sharp, indeed: heorem 10 For an integer k 1 there is a graph G ith µ(g) = k that is not (k 1, k)-coerable. PROOF. It is kno for k 3, so consider that k 4. For an pair of positie integers (k, l) ith k 4 and l 0 e define the graph G l k. Let G0 k = K k+1. For l > 0 e constrct the graph G l k from Gl 1 k b adding, for each cop of K k in G l 1 k that contain a k-erte a ne erte adjacent to the ertices in this cop of K k. According to [7] e hae µ(g l k ) = k for an k and l. Claim 11 For an l 1, the graph G l k has (k + 1)k l 1 k-ertices that form an independant set and (k + 1) ( 1 + l 2 i=0 k i) > k-ertices. Frthermore, this graph has k(k+1) +(k +1) ( l 1 2 i=1 ki) edges linking to > k-ertices and (k +1)k l edges linking a k-erte and a > k-erte. Indeed, it is clear for l = 1 and for the indction e jst note that each of the (k + 1)k l 2 k-ertices in G l 1 k belongs to k copies of K k. Since these ertices form an independant set there is k (k + 1)k l 2 copies of K k in G l 1 k that contain a erte of degree k. So G l k has (k + 1)kl 1 ne ertices of degree k and all the ertices that ere in G l 1 k hae no degree more than k, and there are (k + 1) ( 1 + l 2 i=0 ki) sch ertices. Frthermore, since eer k-erte of G l k is incident to > k-ertices, these k-ertices clearl form an independant set. For the nmber of edges, it is clear that from G l 1 k to G l k e add k ne edges per ne erte (of degree k) and that eer edge present in G l 1 k link to > k-ertices in G l k. We consider no the folloing theorem of Balogh et al. [2]. heorem 12 For eer (t, D)-coerable graph G and an to disjoint sbsets A and B of V (G), f t (A) + e(a, B) D A + t( A + B 1) here e(x, Y ) denotes the nmber of edges of G ith one end in X and the other in Y, and here f t (A) = e(a, A) if e(a, A) t( A 1), and f t (A) = 11
12 2e(A, A) t( A 1) otherise. For an k 4 consider the graph G 3 k, let A be the set of > k-ertices and let B be the set of k-ertices. his theorem sas that if G 3 k as (k 1, k)-coerable e shold hae f k 1 (A) + e(a, B) k A + (k 1)( A + B 1) Note that according to Claim 11 A = (k + 1)(k + 2) and e(a, A) = k(k + 1)(k+3/2), so e hae e(a, A) > (k 1)( A 1). his implies that f k 1 (A) = 2e(A, A) (k 1)( A 1) = 1 2 (k2 +7k+2). hs if G 3 k as (k 1, k)-coerable e shold hae 1 2 (k2 + 7k + 2) + (k + 1)k 3 k(k + 1)(k + 2)+ (k 1)((k + 1)(2 + k + k 2 ) 1), hich is eqialent to 2 + 6k 6k 2 k 3 + k 4 0, and hich does not hold for k 4. hs G 3 k is not (k 1, k)-coerable for k 4 and this complete the proof of the theorem. Another interesting qestion concerns the conseqences of heorem 1. Since the forests of maimm degree for are coerable b to linear forests or b to star forests ith maimm degree three e hae the folloing corollar. Corollar 13 Planar graphs are coerable b : - 6 star forests, to of them haing maimm degree at most three. - 2 forests and 2 linear forests. Planar graphs ith girth g 6 are coerable b : - 4 star forests, to of them haing maimm degree at most three. - 1 forest and 2 linear forests. We hae seen that heorem 1 is optimal, e onder if it is also the case for heorem 2, heorem 3 and for this corollar. References [1] A. Bassa, J. Brns, J.Campbell, A. Deshpande, J. Farle, M. Halse, S. Michalakis, P.-O.Persson, P. Plask, L. Rademacher, A. Riehl, M. Rios, J. Samel, B. enner, A. Vijaasarat, L. Zhao, and D.J. Kleitman. 12
13 Partitioning a Planar Graph of Girth en into a Forest and a Matching manscript (2004). [2] J. Balogh, M. Kochol, A. Plhár and X. Y. Coering planar graphs ith forests, J. Combin. heor B. 94 (2005), [3] Y. Colin de Verdière, Sr n noel inariant des graphes et n critère de planarité J. Combin. heor Ser. B 50 (1990) 1, [4] D. Gonçales. Caterpillar arboricit of planar graphs, Discrete Math. to appear. [5] D.J. Gan, X. Zh, Game chromatic nmber of oterplanar graphs J. Graph heor 30 (1999) 1, [6] W. He, X. Ho, K-W Lih, J. Shao, W. Wang and X. Zh, Edge-partitions of planar graphs and their game coloring nmbers J. Graph heor 41 (2002) 4, [7] H. an der Holst, L. Loász and A. Schrijer On the inariance of Colin de Verdière s graph parameter nder cliqe sms Linear Algebra Appl. 226/228 (1995), [8] C.St.J.A. Nash-Williams. Decompositions of finite graphs into forests, J. London Math. Soc. 39 (1964),
On the maximum average degree and the incidence chromatic number of a graph
Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2
More informationOn a Generalized Graph Coloring/Batch Scheduling Problem
Reglar Papers On a Generalized Graph Coloring/Batch Schedling Problem Giorgio Lcarelli 1, Ioannis Milis Dept. of Informatics, Athens University of Economics and Bsiness, 104 34, Athens, Greece, {glc, milis}@aeb.gr
More information3 Distance in Graphs. Brief outline of this lecture
Distance in Graphs While the preios lectre stdied jst the connectiity properties of a graph, now we are going to inestigate how long (short, actally) a connection in a graph is. This natrally leads to
More informationvalue in arriving packet s header routing algorithm local forwarding table header value output link
Compter Netorks Roting Algorithms Based on Compter Netorking, 4 th Edition b Krose and Ross Interpla beteen roting, forarding roting algorithm local forarding table header ale otpt link 000 00 0 00 ale
More informationHOMOTOPY FIBER PRODUCTS OF HOMOTOPY THEORIES
HOMOTOPY FIBER PRODUCTS OF HOMOTOPY THEORIES JULIA E. BERGNER Abstract. Gien an appropriate diagram of left Qillen fnctors between model categories, one can define a notion of homotopy fiber prodct, bt
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationCSC 505, Fall 2000: Week 8
Objecties: CSC 505, Fall 2000: Week 8 learn abot the basic depth-first search algorithm learn how properties of a graph can be inferred from the strctre of a DFS tree learn abot one nontriial application
More informationJoint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Joint Roting and Schedling in Mlti-hop Wireless Netorks ith Directional Antennas Partha Dtta IBM Research India parthdt@in.ibm.com Viek Mhatre Motorola Inc. iekmhatre@motorola.com Debmalya Panigrahi CSAIL,
More informationCHAPTER ONE VECTOR GEOMETRY
CHAPTER ONE VECTOR GEOMETRY. INTRODUCTION In this chapter ectors are first introdced as geometric objects, namely as directed line segments, or arrows. The operations of addition, sbtraction, and mltiplication
More informationChapter 14. Three-by-Three Matrices and Determinants. A 3 3 matrix looks like a 11 a 12 a 13 A = a 21 a 22 a 23
1 Chapter 14. Three-by-Three Matrices and Determinants A 3 3 matrix looks like a 11 a 12 a 13 A = a 21 a 22 a 23 = [a ij ] a 31 a 32 a 33 The nmber a ij is the entry in ro i and colmn j of A. Note that
More informationSolving Systems of Linear Equations With Row Reductions to Echelon Form On Augmented Matrices. Paul A. Trogdon Cary High School Cary, North Carolina
Solving Sstems of Linear Equations With Ro Reductions to Echelon Form On Augmented Matrices Paul A. Trogdon Car High School Car, North Carolina There is no more efficient a to solve a sstem of linear equations
More informationBasic Linear Algebra
Basic Linear Algebra by: Dan Sunday, softsurfer.com Table of Contents Coordinate Systems 1 Points and Vectors Basic Definitions Vector Addition Scalar Multiplication 3 Affine Addition 3 Vector Length 4
More informationM-Degrees of Quadrangle-Free Planar Graphs
M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru
More informationFixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual Jiong Guo, Rolf Niedermeier, and Sebastian Wernicke Institut für Informatik, Friedrich-Schiller-Uniersität Jena Ernst-Abbe-Platz
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationSmall independent edge dominating sets in graphs of maximum degree three
Small independent edge dominating sets in graphs of maimum degree three Grażna Zwoźniak Grazna.Zwozniak@ii.uni.wroc.pl Institute of Computer Science Wrocław Universit Small independent edge dominating
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationOn end degrees and infinite cycles in locally finite graphs
On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationMobility Management and Its Applications in Efficient Broadcasting in Mobile Ad Hoc Networks
Mobilit Management and Its Applications in Efficient Broadcasting in Mobile Ad Hoc Netorks Jie W and Fei Dai Department of Compter Science and Engineering Florida Atlantic Uniersit Boca Raton, FL 33431
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
More informationAn inequality for the group chromatic number of a graph
Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,
More informationModeling Roughness Effects in Open Channel Flows D.T. Souders and C.W. Hirt Flow Science, Inc.
FSI-2-TN6 Modeling Roghness Effects in Open Channel Flows D.T. Soders and C.W. Hirt Flow Science, Inc. Overview Flows along rivers, throgh pipes and irrigation channels enconter resistance that is proportional
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationStability of Linear Control System
Stabilit of Linear Control Sstem Concept of Stabilit Closed-loop feedback sstem is either stable or nstable. This tpe of characterization is referred to as absolte stabilit. Given that the sstem is stable,
More informationVectors Math 122 Calculus III D Joyce, Fall 2012
Vectors Math 122 Calculus III D Joyce, Fall 2012 Vectors in the plane R 2. A vector v can be interpreted as an arro in the plane R 2 ith a certain length and a certain direction. The same vector can be
More informationLinear Programming. Non-Lecture J: Linear Programming
The greatest flood has the soonest ebb; the sorest tempest the most sdden calm; the hottest love the coldest end; and from the deepest desire oftentimes enses the deadliest hate. Socrates Th extremes of
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationSIMPLE DESIGN METHOD FOR OPENING WALL WITH VARIOUS SUPPORT CONDITIONS
SIMPLE DESIGN METHOD FOR OPENING WALL WITH VARIOUS SUPPORT CONDITIONS Jeng-Han Doh 1, Nhat Minh Ho 1, Griffith School of Engineering, Griffith University-Gold Coast Camps, Qeensland, Astralia ABSTRACT
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationLeveraging History for Faster Sampling of Online Social Networks
Leeraging History for Faster Sampling of Online Social Netorks Zhojie Zho George Washington Uniersity rexzho@g.ed Nan Zhang George Washington Uniersity nzhang10@g.ed Gatam Das Uniersity of Texas at Arlington
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationRemoving Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationAdaptive behaviour in a predator-prey model leads to multiple equilibrium states. A. Pimenov, A. Korobeinikov, D. Rachinskii
Preprint núm. 1195 September 214 Adaptie behaior in a predator-prey model leads to mltiple eqilibrim states A. Pimeno, A. Korobeiniko, D. Rachinskii ADAPTIVE BEHAVIOUR IN A PREDATOR-PREY MODEL LEADS TO
More informationHealth Care ID Card Enhancements
State of California Health Care Enhancements Incorporating National WEDI Indstry Card Standards and the UnitedHealthcare Branding Transition UnitedHealthcare is the first health company to se the national
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationA 2-factor in which each cycle has long length in claw-free graphs
A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationON THE COEFFICIENTS OF THE LINKING POLYNOMIAL
ADSS, Volume 3, Number 3, 2013, Pages 45-56 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationExact moments of generalized order statistics from type II exponentiated log-logistic distribution
Hacettepe Jornal of Mathematics and Statistics Volme 44 3 25, 75 733 Eact moments of generalized order statistics from type II eponentiated log-logistic distribtion Deendra Kmar Abstract In this paper
More informationFactoring bivariate polynomials with integer coefficients via Newton polygons
Filomat 27:2 (2013), 215 226 DOI 10.2298/FIL1302215C Published b Facult of Sciences and Mathematics, Universit of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Factoring bivariate polnomials
More informationCurriculum development
DES MOINES AREA COMMUNITY COLLEGE Crriclm development Competency-Based Edcation www.dmacc.ed Why does DMACC se competency-based edcation? DMACC tilizes competency-based edcation for a nmber of reasons.
More informationUPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More informationGlobal attraction to the origin in a parametrically-driven nonlinear oscillator
Global attraction to the origin in a parametrically-drien nonlinear oscillator M.V. Bartccelli, J.H.B. Deane, G. Gentile and S.A. Gorley Department of Mathematics and Statistics, Uniersity of Srrey, Gildford,
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationHOLES 5.1. INTRODUCTION
HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other
More informationOnline Dominating Set and Variations on. Stephan Eidenbenz. Institute of Theoretical Computer Science, ETH Zurich, Switzerland. eidenben@inf.ethz.
Online Dominating Set and Variations on Restricted Graph Classes TECHNICAL REPORT no. 380, ETH Zurich, Dept. of Comper Science Stephan Eidenbenz Instite of Theoretical Comper Science, ETH Zurich, Switzerland
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationEvery manufacturer is confronted with the problem
HOW MANY PARTS TO MAKE AT ONCE FORD W. HARRIS Prodction Engineer Reprinted from Factory, The Magazine of Management, Volme 10, Nmber 2, Febrary 1913, pp. 135-136, 152 Interest on capital tied p in wages,
More informationChapter 2. ( Vasiliy Koval/Fotolia)
hapter ( Vasili Koval/otolia) This electric transmission tower is stabilied b cables that eert forces on the tower at their points of connection. In this chapter we will show how to epress these forces
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationIntroduction to HBase Schema Design
Introdction to HBase Schema Design Amandeep Khrana Amandeep Khrana is a Soltions Architect at Clodera and works on bilding soltions sing the Hadoop stack. He is also a co-athor of HBase in Action. Prior
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationINVESTIGATIONS AND FUNCTIONS 1.1.1 1.1.4. Example 1
Chapter 1 INVESTIGATIONS AND FUNCTIONS 1.1.1 1.1.4 This opening section introduces the students to man of the big ideas of Algebra 2, as well as different was of thinking and various problem solving strategies.
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationHigh degree graphs contain large-star factors
High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationChapter 21. Epidemics. 21.1 Diseases and the Networks that Transmit Them
From the book Netorks, Crods, and Markets: Reasoning abot a Highly Connected World. By Daid Easley and Jon Kleinberg. Cambridge Uniersity Press, 2010. Complete preprint on-line at http://.cs.cornell.ed/home/kleinber/netorks-book/
More informationOptimal Trust Network Analysis with Subjective Logic
The Second International Conference on Emerging Secrity Information, Systems and Technologies Optimal Trst Network Analysis with Sbjective Logic Adn Jøsang UNIK Gradate Center, University of Oslo Norway
More informationOn one-factorizations of replacement products
Filomat 27:1 (2013), 57 63 DOI 10.2298/FIL1301057A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On one-factorizations of replacement
More informationNon-Separable Detachments of Graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationSpectrum Balancing for DSL with Restrictions on Maximum Transmit PSD
Spectrm Balancing for DSL with Restrictions on Maximm Transmit PSD Driton Statovci, Tomas Nordström, and Rickard Nilsson Telecommnications Research Center Vienna (ftw.), Dona-City-Straße 1, A-1220 Vienna,
More informationClique coloring B 1 -EPG graphs
Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationmost 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia
Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle
More informationSickness Absence in the UK: 1984-2002
Sickness Absence in the UK: 1984-2002 Tim Barmby (Universy of Drham) Marco Ecolani (Universy of Birmingham) John Treble (Universy of Wales Swansea) Paper prepared for presentation at The Economic Concil
More informationOn three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationStrong Ramsey Games: Drawing on an infinite board
Strong Ramsey Games: Drawing on an infinite board Dan Hefetz Christopher Kusch Lothar Narins Alexey Pokrovskiy Clément Requilé Amir Sarid arxiv:1605.05443v2 [math.co] 25 May 2016 May 26, 2016 Abstract
More informationOptimal control and piecewise parametric programming
Proceedings of the Eropean Control Conference 2007 Kos, Greece, Jly 2-5, 2007 WeA07.1 Optimal control and piecewise parametric programming D. Q. Mayne, S. V. Raković and E. C. Kerrigan Abstract This paper
More informationRemoving even crossings
Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer
More informationGraphing Piecewise Functions
Graphing Piecewise Functions Course: Algebra II, Advanced Functions and Modeling Materials: student computers with Geometer s Sketchpad, Smart Board, worksheets (p. -7 of this document), colored pencils
More informationDiscrete Applied Mathematics. The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationDegree-associated reconstruction parameters of complete multipartite graphs and their complements
Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.
More informationSolutions to Assignment 10
Soltions to Assignment Math 27, Fall 22.4.8 Define T : R R by T (x) = Ax where A is a matrix with eigenvales and -2. Does there exist a basis B for R sch that the B-matrix for T is a diagonal matrix? We
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationComputer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
More informationMinimum degree condition forcing complete graph immersion
Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139
More informationOPTIMIZING WEB SERVER'S DATA TRANSFER WITH HOTLINKS
OPTIMIZING WEB SERVER'S DATA TRANSFER WIT OTLINKS Evangelos Kranakis School of Computer Science, Carleton University Ottaa,ON. K1S 5B6 Canada kranakis@scs.carleton.ca Danny Krizanc Department of Mathematics,
More informationOptimal Personalized Filtering Against Spear-Phishing Attacks
Optimal Personalized Filtering Against Spear-Phishing Attacks Aron Laszka and Yevgeniy Vorobeychik and Xenofon Kotsokos Institte for Software Integrated Systems Department of Electrical Engineering and
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More information8. Forced Convection Heat Transfer
8. Forced Convection Heat Transfer 8.1 Introdction The general definition for convection ma be smmarized to this definition "energ transfer between the srface and flid de to temperatre difference" and
More informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationRegular Specifications of Resource Requirements for Embedded Control Software
Reglar Specifications of Resorce Reqirements for Embedded Control Software Rajeev Alr and Gera Weiss University of Pennsylvania Abstract For embedded control systems a schedle for the allocation of resorces
More informationLIMITS IN CATEGORY THEORY
LIMITS IN CATEGORY THEORY SCOTT MESSICK Abstract. I will start assming no knowledge o category theory and introdce all concepts necessary to embark on a discssion o limits. I will conclde with two big
More information