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

Save this PDF as:

Size: px
Start display at page:

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

Transcription

1 - 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 are two spanning trees such that the paths from any other vertex to s on the trees are disjoint. In this paper the result is generalized to 3-connected graphs.

2 Introduction. A graph G =(V (G ),E (G )) consists of a set of vertices V (G ) and a set E (G ) of unordered pairs of V (G ) called edges. An x y path π[x,y ] in a graph G is a sequence of distinct vertices of V (G ) (x = v 0,v 1,...,v m = y ) such that (v i 1,v i ) E (G ) (i =1,...,m ). Two paths π 1 [x 1,y 1 ] and π 2 [x 2,y 2 ] are disjoint if they have no common vertices except perhaps {x 1,y 1 } {x 2,y 2 }. Let κ(x,y ;G ) denote the maximum number of disjoint x y paths in G. A graph G is k-connected if between any two vertices of G there are at least k disjoint paths. The connectivity, κ(g ), of G is the maximum integer k such that G is k -connected, i.e., min{κ(x,y ;G ) : x,y V (G )} = k. If v V (G ) we denote by Γ(v ) the set of all vertices adjacent to v while Γ E (v ) denotes the set of edges adjacent to v. The degree of v, deg (v ;G ), is equal to the cardinality of Γ E (v ). A vertex v is a leaf if deg (v ;G )=1. We abuse the notation and say that an edge or a vertex belongs to a graph (e G or v G instead of e E (G ) or v V (G )). Also, G e denotes the graph from which e was deleted from the edge set (likewise G +e ). For all other notations refer to Bondy & Murty ([BM76]). Let T be a spanning tree of G and v,w V (G ) then T [v,w ] is the path from v to w on T. The following result appears in [IR]: Theorem 1.1 If G is a 2-connected graph and s V (G ), then there exist two spanning trees of G, T 1, T 2, such that for every vertex v G the paths T 1 [v,s ] and T 2 [v,s ] are disjoint. Itai and Rodeh [IR] used this result to develop distributed algorithms which are resilient to the failure of a single line (or processor). To increase reliability more spanning trees are needed. The purpose of this paper is to prove the following: Theorem 1.2 If G is a 3-connected graph and s V (G ), then there exist three spanning trees of G, T i (i =1,2,3), such that for every vertex v G, the paths T i [v,s ] (i =1,2,3) are disjoint.

3 - 3 - We start the paper by proving general properties of 3-connected graphs (Section 2). To prove the theorem, in Section 3 we define a property, Extended 3-Tree Path property (E3TP), which implies the existence of the three trees. The remainder of the paper shows that 3-connectivity implies E3TP. To that end, we investigate the structure of a minimal counterexample (MCE). In Section 4 we show that in every MCE, deg (s )=3. In Section 5 it is shown that an MCE cannot contain certain subgraphs. The proof is completed in Section 6. While Section 7 contains the conclusions. Our proof methodology is to obtain from an MCE, G, a smaller graph G, then show that G is 3-connected, thus by definition of MCE, G satisfies E3TP. Thus G contains three trees, which we modify to get three trees in G. 2. Connectivity Let U V (G ) then E (U ;G ) consists of all the edges of G both endpoints of which belong to U and the subgraph induced by U is the graph G [U ]=(U, E (U ;G )). A set S V (G ) is a separation set of G if its deletion from G increases the number of connected components. A separation set is a minimum separation set if its cardinality is minimum. The concatenation πσ of two edge-disjoint paths π=π[v,x ] = (v =v 0,...,v n =x ) and σ=σ[x,w ] = (x =v n,v n +1,...,v m ) is the v w path obtained by deleting cycles from the sequence (v =v 0,...,v m =w ). Lemma 2.1 Let G be a 3-connected graph, S ={v 1,v 2,v 3 } a separation set of G and e =(v 1,v 2 ). Then for all vertices x,y V (G ) {v 1,v 2 }, κ(x,y ;G e ) = 3. Case 1: v 3 {x,y }: Thus, x,y V (G ) S. If x and y belong to different connected components of G S then there exist three x y paths which do not use e. Thus, assume x and y are in the same component. At most one x y path uses e. In this path, e can be replaced by a v 1 v 2 path which except for its endpoints lies entirely in a component not containing x and y.

4 - 4 - Case 2: v 3 {x,y }: W.l.g., v 3 =y. In G there are three x v 3 paths. At most one of them, say π 1, uses e. (If none uses e, we are done.) The other two paths lie entirely in the connected component of G S which contains x. Let π 1 = π 1 [x,v i ](v i,v 3 i )π 1 [v 3 i,v 3 ], for i =1 or i =2. Let σ be a v i v 3 path in the connected component of G S not containing x. Then replace π 1 by the path π 1 =π 1 [x,v i ]σ to obtain three x v 3 paths in G e. The following two lemmas follow from Menger s Theorem, Lemma 2.2: Let v V (G ) and deg (v ;G ) k. If for every two vertices x,y v, κ(x,y ;G ) k then κ(g ) k. If κ(g )<k there exists a set W of cardinality k 1 separating v from some other vertex, say x. Since deg (v ) k, v has a neighbor y W. Thus W separates y from x, which implies κ(x,y ;G ) k 1. An edge e is subdivided when it is deleted and replaced by a path of length two connecting its endpoints, the internal vertex of this path being a new vertex. The graph G is a subdivision of H if G can be obtained from H by a series of edge subdivisions. Let h (G ) be the minimum size graph H such that G is a subdivision of H. Lemma 2.3 Let G be a 3-connected graph, S ={v 1,v 2,v 3 } a separating set and e =(v 1,v 2 ). Then H =h (G e ) is 3-connected. It is sufficient to show that every two vertices x,y V (H ) are connected by three disjoint paths. By Lemma 2.1, {x,y } {v 1,v 2 }. Thus, w.l.g., x = v 1, Case 1: deg (v 1 ;G )=3: we are done since deg (v 1 ;G e )=2, implying that v 1 H. Case 2: deg (v 1 ;G )>3: If deg (y ;G e )=2 then y =v 2 and by reversing the roles of x and y we return to Case 1. Thus, deg (y ;G e ) 3. Let W ={w 1,w 2 } V (H ) separate between v 1 and y in G e (thus v 1

5 - 5 - and y are not connected in G e ). Since deg (v 1 ;G e ) 3, in G e v 1 has a neighbor u 1 W {y }. If y v 2, W separates between u 1 and y contrary to Lemma 2.1. Otherwise, y =v 2 has a neighbor u 2 W {v 1 } and W separates between u 1 and u 2 again contradicting Lemma 2.1. Remark: Figure 2.1 shows that the condition e E (S ) is necessary. Let e = (x,y ) be an edge of G. The contraction of e in G (G e ) is the graph resulting from G by replacing the vertices x,y by a single vertex xy and connecting it to Γ(x ;G ) Γ(y ;G ) {x,y }. Corollary 2.4: Let G be a 3-connected graph and e = (v 1,v 2 ) E (G ). Then either G e or h (G e ) is 3- connected. If G e is only 2-connected then v 1 and v 2 belong to some minimum separating set S ={v 1,v 2,v 3 }, to which the previous lemma may be applied. We conclude this section with a lemma to be used in Section 6. Let x G and S V (G ). An x S fan is a set of disjoint paths π 1 [x,y 1 ],...,π k [x,y k ] were all the vertices y i are distinct vertices of S ; k is the size of the fan. Lemma 2.5 Let B V (G ) be a set of vertices such that κ(x,y ;G ) = k for all x,y B. If for every other vertex v there is a v B fan of size k, then κ(g ) = k. v 1 v 2 e v 3 Figure 2.1

6 - 6 - Let v,w be two vertices of G and S a separation set of G which separates v from w, such that S <k. By our assumption S cannot separate all v B paths nor all w B paths. Thus, for some x,y B there are two paths π[v,x ] and σ[w,y ] which do not pass through vertices of S. As x,y B there are k disjoint x y paths, and S cannot separate all of them. Let τ[x,y ] be an x y path not passing through S. We conclude that ρ = π[v,x ]τ[x,y ]σ[y,w ] is a v w path not passing through S (ρ is a path since by our definition of concatenation of paths cycles are deleted); thus S does not separate v from w. 3. Extended three tree path property. Let S be a set. The relation S S is an order on S if is irreflexive, antisymmetric, transitive and total, i.e., for all u,v S either v u or u v. To prove Theorem 1.2 we need the following definition of an s t ordering which is equivalent to the s t numbering found in [Ev] and used in [IR]. Let e =(s,t ) be an edge in a graph G. An s t ordering of G is an order on the vertices of G such that: (S1) s is minimum and t is maximum, i.e. for all v s,t s v t. (S2) For every vertex v V (G ) {s,t } there are two vertices v 1,v 2 Γ(v ) such that v 1 v v 2. In [Ev] it is proven that such a ordering exists for all 2-connected graphs. Let be an order on the vertices of the graph G. A path π=(v 1,., v n ) increases ( decreases ) if v 1 v 2. v n (v n v n 1. v 1 ). Let s be the minimum vertex of. A pair of spanning trees, (T 1,T 2 ) are ordered by if for every vertex v the path T 1 [v,s ] -decreases and the path T 2 [v,s ] s -increases. (In this case T 2 [v,s ] s = T 2 [v,t ].) The motivation for this definition is that when u v, T 1 [u,s ] and T 2 [v,s ] are disjoint. The following lemma is useful in proving that an order is an s t ordering.

7 - 7 - Lemma 3.1 If the pair of spanning trees (T 1, T 2 ) is ordered by which satisfies (S1) for some edge (s,t ) then is an s t ordering. Let v s,t be a vertex of G. Since (T 1,T 2 ) are ordered by, the path T 1 [v,s ] = (v,v 1 )T 1 [v 1,s ] is - decreasing. Therefore v 1 is a neighbor of v satisfying v 1 v. Considering T 2 [v,t ] provides us with another neighbor v 2 satisfying v v 2. We now show a simple application of this lemma to be used in the proof of our last theorem. Lemma 3.2 Let T 1, T 2 be spanning trees of a graph G and an s t order of G. If (T 1,T 2 ) is ordered by and Γ(s ;T 1 )={v } then there exists an s v order such that (T 2,T 1 ) is ordered by. To define, let s be the -minimum and v the -maximum. For all other vertices u,w if u w then define w u. Since a -increasing (decreasing) path is -decreasing (increasing), (T 2,T 1 ) is ordered by, so by the previous lemma is an s v ordering. Let s V (G ), and e 1,e 2 Γ E (s ). The quadruple (G,s,e 1,e 2 ) satisfies the Extended 3-Tree Path property (E 3TP ) if there are three trees (T 1,T 2,T 3 ) such that: (E1) T i are spanning trees of G (i =1,2,3). (E2) For all v G T 3 [v,s ] is disjoint of T 1 [v,s ] and T 2 [v,s ]. (E3) E (T i ) Γ E (s ) = {e i } for i = 1,2. (E4) If e 2 = (s,t ) then there exists an s t ordering of G such that (T 1,T 2 ) is ordered by. Note that by (E4) T 1 [v,s ] and T 2 [v,s ] are disjoint, and in fact was introduced to facilitate proving that.

8 - 8 - Lemma 3.3 Let G be a graph. If for every s V (G ) there exist e 1,e 2 Γ E (s ), such that (G,s,e 1,e 2 ) satisfies E3TP then G is 3-connected. We show that between every v,w V there exist three disjoint paths. Let e 1,e 2 Γ E (v ). Since (G,v,e 1,e 2 ) satisfies E3TP construct the three trees. The desired paths are T i [w,v ] (i =1,2,3). Note that some 2-connected graphs G may satisfy E3TP for some s, e 1 and e 2 (Figure 3.1). Our goal will be to prove the converse of this lemma, namely, for every 3-connected graph G, s V (G ) and e 1,e 2 Γ E (s ), (G,s,e 1,e 2 ) satisfies E3TP. To this end, (G,s,e 1,e 2 ) is a counterexample if G is a 3-connected graph, s V (G ), e 1,e 2 Γ E (s ) and (G,s,e 1,e 2 ) does not satisfy E3TP. A minimum-counter-example (MCE ) is a counterexample for which V (G ) + E (G ) is minimum. A graph G is an MCE if there exist s,e 1 and e 2 s.t. (G,s,e 1,e 2 ) is an MCE. To satisfy our goal of proving Theorem 1.2, we show that there exists no MCE. 4. Reducing the degree of the root of an MCE 4.1 Edge contraction in MCE. In this and the following section we investigate the structure of an MCE. Here we consider contracting an edge incident with s, and in subsection 4.2 we delete such an edge. s e 1 e v Figure 3.1 T 1 T 2 T. 3 S = {s,v }

9 - 9 - Lemma 4.1: Let e = (s, p ) e 1,e 2. If κ(g e ) = 3 then (G,s,e 1,e 2 ) is not an MCE. For the sake of contradiction assume that (G,s,e 1,e 2 ) is an MCE. By hypothesis G e is 3-connected. If e i =(s,v i ) then let e i =(sp,v i ). By the minimality of G, (G e,sp,e 1,e 2 ) satisfies E3TP. Let T i (i =1,2,3) be the corresponding trees in G e and the sp t ordering. As deg (p ;G ) 3, p has two neighbors p 1,p 2 s. Assume, w.l.g., that p 1 p 2. Define now T i = T i e i +e i +(p,p i ) (i =1,2). Note that T i [p,s ] = (p,p i )T i [p i,s ]. The tree T 3 is obtained from T 3 by adding the edge (s,p ) and replacing each edge of the form (v,sp ) by the corresponding edge (either (v,s ) or (v,p )) of G. p 1 p p 2. To define the s t ordering in G let be any extension of to all of V (G ) such that We prove now that the new trees satisfy E3TP in G. (E1) The subgraph T i is a spanning tree of G since V (T i ) = V (G e ) +1 = V (G ) and E (T i ) = E (T i ) +1 = ( V (G e ) 1)+1 = V (G ) 1. (E2) We show that T 1 [v,s ] and T 3 [v,s ] are disjoint, the proof for T 2 [v,s ] is identical. For v p : T 1 [v,s ] = T 1 [v,sp ] e 1 +e 1. Thus, since T 1 [v,sp ] and T 3 [v,sp ] are disjoint, T 1 [v,s ] T 3[v,s ] {v,s,p }. Since p is a leaf of T 1 and v p, p V (T 1 [v,s ]) and so T 1 [v,s ] and T 3 [v,s ] are disjoint. As for p, by the construction T 1 [p,s ] = (p,p 1 )T 1 [p 1,sp ], and T 3 [p,s ] = (p,s ). Therefore, also the path T 1 [p,s ] is disjoint of T 3 [p,s ]. (E3) Actually no edges were removed from T i i =1,2 and the only added edge is (p,p i ) which is not adjacent to s. (E4) By definition is a total order and as p 1 p p 2 (S1) holds. By Lemma 3.1 it remains to show that (T 1,T 2 ) are ordered by. For v p, T i [v,sp ]=T i [v,s ] (i =1,2). Since T 1 [v,sp ] is -

10 decreasing then so is T 1 [v,s ]. Thus, it remains to check only for p. T 1 [p,s ] = (p,p 1 )T 1 [p 1,sp ] and as p 1 p and T 1 [p 1,sp ] is -decreasing so is T 1[p,s ]. The proof that T 2 [p,t ] is -increasing is identical. 4.2 Edge removal. Let e = (s,p ) e 1,e 2. If G e is 3-connected then obviously (G,s,e 1,e 2 ) is not an MCE. In this section we generalize this observation to the case where deg (p ;G e ) = 2. Lemma 4.2 Let s G with deg (s ;G )>3 and e Γ E {e 1,e 2 }. If H =h (G e ) is 3-connected then (G,s,e 1,e 2 ) is not an MCE. Assume that (G,s,e 1,e 2 ) is an MCE. Let e = (s,p ). If deg (p ;G )>3 then H =G e. Since by the hypothesis H is 3-connected, (H,s,e 1,e 2 ) is a smaller counterexample. Therefore, deg (p ;G ) = 3. Let Γ(p ) = {p 1,p 2,s }. If p V (H ) then since deg (p ;H )=2, H is not 3-connected. (This happens only if (p 1,p 2 ) E (G ).) Thus V (H ) < V (G ) and since (G,s,e 1,e 2 ) is an MCE, (H,s,e 1,e 2 ) satisfies E3TP. Let T i (i =1,2,3) be the corresponding trees, and the s t ordering. Assume, w.l.g., that p 1 p 2. If the edge (p 1,p 2 ) belongs to T 3 then assume, w.l.g., that T 3 [p 1,s ] = (p 1,p 2 )T 3 [p 2,s ] and define T 3 = T 3 (p 1,p 2 )+(p 1,p )+(p,s ). Otherwise, T 3 = T 3 +(p,s ). (Thus we may have shortened some paths of T 3.) Now we construct the other two trees: If (p 2,p 1 ) E (T 1 ) then T 1 = T 1 (p 2,p 1 )+(p 2,p )+(p,p 1 ). Otherwise, T 1 = T 1 +(p,p 1 ). If (p 1,p 2 ) E (T 2 ) then T 2 = T 2 (p 1,p 2 )+(p 1,p )+(p,p 2 ). Otherwise, T 2 = T 2 +(p,p 2 ). To define the s t ordering in G let be any extension of to all vertices of G such that p 1 p p 2. We prove that the trees T i (i =1,2,3) satisfy E3TP in G. (E1) and (E2) By our construction, replacing the edge (p 1,p 2 ) by the path (p 1,p,p 2 ) leaves the trees connected without introducing any cycles. If (p 1,p 2 ) T 3 [v,s ] then (p 1,p 2 )T i [v,s ] (i =1,2),

11 T 3 [v,s ] T 3 [v,s ]+(p 1,p )+(p,s ) and thus is disjoint of T i [v,s ]. Otherwise, T 3 [v,s ] = T 3 [v,s ] and therefore, (E1) and (E2) hold for T j (j =1,2,3). Thus, it remains to prove these conditions only for p. But T 1 [p,s ] = (p,p 1 )T 1 [p 1,s ], T 2 [p,s ] = (p,p 2 )T 2 [p 2,s ] and T 3 [p,s ] = (p,s ) are disjoint. (E3) No edges adjacent to s were added or removed from T 1 and T 2. Thus this condition remains unchanged. (E4) First we prove that is an s t ordering. Since satisfies condition (S1), by Lemma 3.1 it remains to show that (T 1,T 2 ) are ordered by. For p, T 1 [p,s ] = (p,p 1 )T 1 [p 1,s ] p 1 p and the path T 1 [p 1,s ] -decreases. Similarly, since p p 2, the path T 2 [p,t ] = (p,p 2 )T 2 [p 2,t ] - increases. For v p then we have to check only the case where (p 2,p 1 ) T 1 [v,s ] (and similarly for T 2 [v,t ]). As p 1 p 2, p 1 appeared in T 1 [v,s ] after p 2. To get T 1 [v,s ] we replaced the edge (p 2,p 1 ) by the path (p 2,p,p 1 ), but p 1 p p 2, thus the order on T 1 [v,s ] is preserved. 4.3 The root-degree of an MCE. In this section we prove the following, Lemma 4.3 If (G,s,e 1,e 2 ) is an MCE then deg (s ) = 3. Let e Γ E (s ) {e 1,e 2 }. By Corollary 2.4 either G e or h (G e ) is 3-connected. If G e is 3-connected then by Lemma 4.1 (G,s,e 1,e 2 ) is not an MCE. Thus, κ(h (G e )) 3. If deg (s )>3 then by Lemma 4.2 (G,s,e 1,e 2 ) is not an MCE. In the remaining sections we assume deg (s ) = 3. Lemma 4.4 Let Γ E (s ) = {s 1,s 2,s 3 } and (G,s,(s,s 1 ),(s,s 2 )) satisfy E3TP. Let T 1,T 2,T 3 be the corresponding trees. Then for 1 i,j 3 and i j, s i is a leaf of T j.

12 Assume, for example, that s 1 is not a leaf of T 2, then there exists a vertex x such that T 2 [x,s ]=T 2 [x,s 1 ]T 2 [s 1,s ]. Since, T 1 [x,s ]=T 1 [x,s 1 ](s 1,s ), T 1 [x,s ] T 2[x,s ] {s 1 }, i.e., the two paths are not disjoint, contrary to the hypothesis. 5. Illegal subgraphs in an MCE. This section deals with an MCE for which deg (s ) = 3 and shows several subgraphs which cannot be contained in an MCE. The proofs of these lemmas are very similar to the proofs of Lemmas 4.1 and 4.2, so we will be more brief. Lemma 5.1 Let F 1 be the graph of Fig 5.1. If G contains the graph F 1 as a subgraph and deg (v ;G ) = 3 then for e 2 (s,p ), (G,s,e 1,e 2 ) is not an MCE. Remark: The vertices s, p and q are connected to G F 1 ; (p,q ) may also belong to G. If G is an MCE then by Lemma 4.3 deg (s ;G )=3. Let Γ E (s ;G )={e 1,e 2,e 3 }, then since by definition e 1 =(s,v ) and e 2 (s, p ), we have e 3 =(s,p ). By the minimality of G, H =h (G b ) is not an MCE. We first show that κ(h )=3, then use the three spanning trees of H to construct trees for G. Claim: κ(h ) = 3. of Claim: Obviously, Γ(s ;G ) = {u, p,v } is a separating set of G. Applying Lemma 2.1 to Γ(s ;G ) shows that except perhaps for x =v or y =p κ(x,y ;G b )=3. We need not prove the connectivity v e 1 b s p q Figure 5.1 F 1

13 for v since deg (v ;G b )=2 and thus it does not belong to H. If deg (p ;G )=3 then p does not belong to H. Thus, for all x,y V (H ), κ(x,y ;G b )=3, from which the claim follows. Otherwise, deg (p ;H ) 3; thus by Lemma 2.2 κ(h )=3. (For both cases we have equality since deg (s ;H )=3.) Define e H 2 to be the sole member of the set Γ E (s ;H ) {(s,q ),e 3 }. Since G is an MCE, (H,s,(s,q ),e H 2 ) satisfies E3TP. Let T H i (i =1,2,3) be the corresponding trees and H the s t ordering. Note that s H q and q H w for all w V (H ) {s,q }. Case 1: deg (p ;G )>3. In this case p H, so e H 3 = (s,p ). The s t ordering for G is defined as s v q and agrees with H on all other vertices. The trees are T 1 = T H 1 (s,q )+(s,v )+(v,q ), T 2 = T H 2 +(v,q ), T 3 = T H 3 +(p,v ). Case 2: deg (p ;G ) = 3. The s t ordering for G is defined as s v p q and agrees with H on all other vertices. Let Γ(p ) = {s,v, p 1 }. Then by definition, e 3 H = (s, p 1 )G. Define T 1 = T 1 H (s,q )+(s,v )+(v,q )+(v, p ), T 2 = T 2 H +(v,q )+(p 1, p ), T 3 = T 3 H (s, p 1 )+(s, p )+(p, p 1 )+(p,v ). Lemma 5.2 Let F 2 and F 3 be the graphs of Fig 5.2. If G contains either F 2 or F 3 and v,w have no additional neighbors, then for e 2 (s,p ) (G,s,e 1,e 2 ) is not an MCE. G b is 3-connected. Thus G cannot be an MCE. Lemma 5.3 Let F 4 be the graph of Fig 5.3. If G contains F 4, e 2 (s, p ) and v,w have no additional neigh-

14 v w v w e 1 b e 1 s p q s p b q F 2 bors, then (G,s,e 1,e 2 ) is not an MCE. Figure 5.2 F 3 Remark: W.l.g., (p,q )G, since otherwise we have the graph F 3. It is easy to show that H = h (G b ) is 3-connected. Thus, if (G,s,e 1,e 2 ) is an MCE, (H,s,(s,q ),e 2 ) satisfies E3TP. Let T H i (i =1,2,3) be the corresponding trees and H the s t ordering. By Lemma 4.4 p is a leaf of T H 1,T H 2 and q is a leaf of T H 2,T H 3. W.l.g., T H 1 [p,s ] = (p,q,s ). As (p,q ) T H 1 then T 1 = T H 1 (q,s ) (p,q )+(q,v )+(w,v )+(v,s )+(p,w ), and T 2 = T H 2 +(v,q )+(w,q ), W.l.g, T H 3 [q,s ] = (q, p,s ) then let T 3 = T H 3 (q, p )+(q,w )+(w, p )+(v,w ) is defined as the extension of H H }. to G which satisfies s v w min{z z V (G ) s ordered by We now come to the main lemma of this section. Lemma 5.4 Let (G,s,e 1,e 2 ) be an MCE such that {s, p,q } is a separation set with (s, p ) G and v b w e 1 s p q F 4 Figure 5.3

15 e 1,e 2 (s, p ). Then each component of G {s, p,q } contains more than two vertices. Let B be a component of G S. If V (B ) =1 then the subgraph spanned by S and B is the graph F 1. If V (B ) =2 then the subgraph spanned by S and B is one of the graphs F i G is not an MCE. i = 2,3,4. In both cases 6. E3TP and 3-connected graphs. We give now the main result of this paper which implies Theorem 1.2. Theorem 6.1 Let G be a 3-connected graph, s V (G ) and e 1,e 2 Γ E (s ), then (G,s,e 1,e 2 ) satisfies E3TP. As shown in Fig 6.1 if V (G ) = 4, E3TP is satisfied. Thus, V (G ) >4. Assume the theorem is false and let (G,s,e 1,e 2 ) be an MCE. By Lemma 4.3, deg (s ) = 3. Let Γ E (s ) = {e 1,e 2,e 3 }, where e 3 = (s,p ). By Lemma 4.1, κ(g e 3 )=2. Therefore, there is a vertex q such that S = {s,p,q } is a separating set. Since s must have an edge in each component, G S contains only two components G 1,G 2 and since deg (s ;G )=3 and (s, p ) G, (s,q )E (G ). By Lemma 5.4 V (G i ) >2 (i =1,2). Case 1: (p,q )E (G ). As there are three disjoint paths from q to s we may assume, w.l.g., that at least two of them pass through G 2 +s +p. Since deg (s )=3 one of these paths contains e 3. Also, there is always at least one path s x 1.. x 3 x 2 s x 1 x 2 x 3 Figure 6.1

16 in G 1. Let G 2 = G G 1 (the contraction of G 1 to a single vertex u ) and G 1 the graph resulting from G by replacing G 2 by F 4 (see Fig. 6.2). I.e. V (G 1 ) = V (G ) V (G 2 )+{v,w } and E (G 1 ) = E (G ) E (G 2 )+(v,w )+(s,v )+(v,q )+(w,p )+(w,q ); (u,v and w are new vertices.) Now we prove that G 1 and G 2 are 3-connected. Claim 1: G 1 is 3-connected. Since there is at least one path between any two vertices of s,p,q containing only vertices of G 1, any two vertices x,y {s,p,q } are 3-connected. For x s,p,q there exists an x {s,p,q } fan. Thus, by Lemma 2.5, G 1 is 3-connected. Claim 2: G 2 is 3-connected. As it can be verified that the connectivity between any two vertices q is 3, the claim follows by Lemma 2.2. G 1 G 1 s p q G 1 s p q v w G 2 u s p q G 2 G 2 Figure 6.2

17 Case 1.1 t G 2 : As V (G i ) >2 (i =1,2), V (G i ) < V (G ) therefore (G 1,s,e 1,(s,v )) and (G 2,s,(s,u ),e 2 ) satisfy E3TP. (Note that in G 1 v plays the role of t.) Let T 1 1,T 2 1,T 3 1 be the trees in G 1, 1 an s v ordering and T 2 1,T 2 2 2,T 3 the trees in G 2 with an s t ordering 2. For i =1, 2, 3, define: T i = T 1 i T 2 i {u,v,w }. (Note that (s, p ) belongs to both T 1 3 and T 2 3.) Assume s 1 x 1 1,...,x l 1 1 q are the vertices of G 1 S and s =y 1 2,., 2 y l 2 =t are the vertices of G 2. Define to agree with 1 on vertices of G 1 S and with 2 on vertices of G 2 also if x G 1 S and y G 2 then x y. We prove now that T 1,T 2,T 3 satisfy E3TP. (E1) It is easy to verify that for each vertex x there exists a x s path on each T i. Thus each of the T i s is connected and span G. To show that T i contains no cycles we check the number of edges of T i. For example: E (T 1 ) = E (T 1 1 ) 2+ E (T 1 2 ) 3 = V (G 1 ) 1+ V (G 2 ) 1 5 = V(G 1 ) + V (G 2 ) 7 = V (G ) +6 7 = V (G ) 1. Thus, T 1 is a spanning tree. (E2) If x =p then T 3 [p,s ]=(p,s ) (= T 3 1 [p,s ] = T 3 2 [p,s ]), which is disjoint of T i [p,s ] (i =1,2). If x G 1. T 1 [x,s ] = T 1 1 [x,s ], T 2 [x,s ] = T 2 1 [x,q ]T 2 2 [q,s ] and T 3 [x,s ] = T 3 1 [x,s ] = T 3 1 [x,p ](p,s ). (1) (2) (3) By E3TP in G 1, T 3 [x,s ] is disjoint of T 1 [x,s ] and of T 1 2 [x,q ]. It remains to show that T 3 [x,s ] is disjoint of T 2 2 [q,s ]. This follows because the former lies entirely in G 1 +s and the latter in G 2 +q +s. The remaining cases (x G 2 and x =q ) are similar. (E3) By the construction, only edges belonging to the original graph G appear in T i. Therefore, for each tree T i (i =1,2) Γ E (s ;G ) T i = {e i }.

18 (E4) To prove that is a s t ordering we first show condition (S1), i.e. that s is the minimal vertex of. The maximal vertex of is equal to the maximal vertex of 2. Note that by E3TP in G 2, 2 does not obtain that maximum on q or p. By Lemma 3.1 it remains to show that (T 1,T 2 ) are ordered by. We show now that T 1 [x,s ] is -decreasing for x G. Assume x G 1, then T 1 [x,s ]=T 1 1 [x,s ]. As and 1 agree on G 1, T 1 [x,s ] is -decreasing. If x G 2 then T 1 [x,s ]=T 1 2 [x,q ]T 1 1 [q,s ]. By E3TP on G 2 T 1 2 [x,q ] is 2 -decreasing and as before T 1 1 [q,s ] is 1 -decreasing. Now agrees with 1 on G 1 and with 2 on G 2. Therefore, T 1 [x,s ] is - decreasing. The proof that T 2 [x,s ] s is -increasing is similar. Case 1.2 t G 1 : As before, (G 1,s,e 2,(s,v )) and (G 2,s,(s,u ),e 1 ) satisfy E3TP. We proceed as in case 1.1 to obtain three trees T 1, T 2, T 3 G satisfying (E1-E4). In particular, there exists an s v order ordering (T 1,T 2 ). Since Γ(s ;T 1 )={t }, we may use Lemma 3.2 to obtain an s t order such that (T 2,T 1 ) is ordered by. Thus (T 2,T 1,T 3 ) are three trees which demonstrate that (G,s,e 1,e 2 ) satisfies E3TP. Case 2: (p,q ) E (G ) In this case we construct G 1 = G G 2 and G 2 = G G 1. The rest of the proof is identical to case 1. _ _ 7. Conclusions. Conjecture The results of this paper and [IR] suggest the following conjecture: If a graph G is k -connected and s G then there exist k spanning trees of G such that the paths from any vertex v to s on the spanning trees are disjoint. In this paper we used s t ordering to ensure that the paths T 1 [v,s ] and T 2 [v,s ] are disjoint. We have not been able to extend this method to k >3. Also, since our proof is much more complicated that

19 that of k =2, new ideas are required. A similar conjecture can be stated for edges: Namely, if the graph is k -edge connected then for every vertex s there exist k spanning trees such that the paths from any vertex v to s on the spanning trees are edge-disjoint. Both conjectures were proven for k =2 [IR]. It seems that methods similar to those of this paper are sufficient to prove the edge-conjecture for k =3. However, we feel that it is more promising to show that for all k the vertex-conjecture implies the edge-conjecture (or vice versa).

20 References. [BM76] J. A. Bondy & U. S. R. Murty, Graph Theory with Applications NH Publishing. [Ev] S. Even, Graph Algorithms, Pitman Publishing, pp [IR] A. Itai & M. Rodeh, The Multi-Tree Approach to Reliability in Distributed Networks, 25 Symp. on the Foundation of Computer Science, Oct. 1984, pp , to appear also in Information and Computation. [Lo] L. Lovasz, Combinatorial Problems and Exercises, NH Publishing, 1979.

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

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

On the independence number of graphs with maximum degree 3

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

Connectivity 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

Odd 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

Graphs without proper subgraphs of minimum degree 3 and short cycles

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

All 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

8. 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,

Labeling outerplanar graphs with maximum degree three

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

Mean Ramsey-Turán numbers

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

Cycles 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

On end degrees and infinite cycles in locally finite graphs

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

Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of

SHARP 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.,

ON 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

Every tree contains a large induced subgraph with all degrees odd

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

Large induced subgraphs with all degrees odd

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

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

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

Non-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.

1 Definitions. Supplementary Material for: Digraphs. Concept graphs

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

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

On Integer Additive Set-Indexers of Graphs

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

The positive minimum degree game on sparse graphs

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

Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

Discrete 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

When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

UPPER 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

On the k-path cover problem for cacti

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

3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

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

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

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

A 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:

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

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

Class One: Degree Sequences

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

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

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

Minimum 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

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

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

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

High 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

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

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

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

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

On an anti-ramsey type result

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

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

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

Best 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

Total 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

8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

Topology-based network security

Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

A New Approach to Dynamic All Pairs Shortest Paths

A New Approach to Dynamic All Pairs Shortest Paths Camil Demetrescu Giuseppe F. Italiano Abstract We study novel combinatorial properties of graphs that allow us to devise a completely new approach to

Network (Tree) Topology Inference Based on Prüfer Sequence

Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,

Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. 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.

Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

An 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

HOLES 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

Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

Midterm Practice Problems

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

Removing 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

A Graph-Theoretic Network Security Game

A Graph-Theoretic Network Security Game Marios Mavronicolas 1, Vicky Papadopoulou 1, Anna Philippou 1, and Paul Spirakis 2 1 Department of Computer Science, University of Cyprus, Nicosia CY-1678, Cyprus.

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

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

Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

Removing 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,

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

A short proof of the VPN Tree Routing Conjecture on ring networks

Operations Research Letters 36 (008 361 365 www.elsevier.com/locate/orl A short proof of the VPN Tree Routing Conjecture on ring networs Fabrizio Grandoni a, Voler Kaibel b, Gianpaolo Oriolo c,, Martin

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

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

A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

Disjoint Compatible Geometric Matchings

Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,

Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

Divisor graphs have arbitrary order and size

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

Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

On the crossing number of K m,n

On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known

THE ROOMMATES PROBLEM DISCUSSED

THE ROOMMATES PROBLEM DISCUSSED NATHAN SCHULZ Abstract. The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which

Degree-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.

On Pebbling Graphs by their Blocks

On Pebbling Graphs by their Blocks Dawn Curtis, Taylor Hines, Glenn Hurlbert, Tatiana Moyer Department of Mathematics and Statistics Arizona State University, Tempe, AZ 85287-1804 November 19, 2008 dawn.curtis@asu.edu

Social Media Mining. Graph Essentials

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

Degree Hypergroupoids Associated with Hypergraphs

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

On the Relationship between Classes P and NP

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

BOUNDARY EDGE DOMINATION IN GRAPHS

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

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a

Lecture Notes on GRAPH THEORY Tero Harju

Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN-20014 Turku, Finland e-mail: harju@utu.fi 1994 2011 Contents 1 Introduction..........................................................

Clique coloring B 1 -EPG graphs

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

Network File Storage with Graceful Performance Degradation

Network File Storage with Graceful Performance Degradation ANXIAO (ANDREW) JIANG California Institute of Technology and JEHOSHUA BRUCK California Institute of Technology A file storage scheme is proposed

Probe Station Placement for Robust Monitoring of Networks

Probe Station Placement for Robust Monitoring of Networks Maitreya Natu Dept. of Computer and Information Science University of Delaware Newark, DE, USA, 97 Email: natu@cis.udel.edu Adarshpal S. Sethi

Cycle transversals in bounded degree graphs

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

ONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN. Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015

ONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015 ONLINE STEINER FOREST PROBLEM An initially given graph G. s 1 s 2 A sequence of demands (s i, t i ) arriving

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. An Improved Approximation Algorithm for the Traveling Tournament Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS An Improved Approximation Algorithm for the Traveling Tournament Problem Daisuke YAMAGUCHI, Shinji IMAHORI, Ryuhei MIYASHIRO, Tomomi MATSUI METR 2009 42 September

Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

GENERATING LOW-DEGREE 2-SPANNERS

SIAM J. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 27, No. 5, pp. 1438 1456, October 1998 013 GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG Abstract. A k-spanner

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

Exponential time algorithms for graph coloring

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

Triangle deletion. Ernie Croot. February 3, 2010

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

Types of Degrees in Bipolar Fuzzy Graphs

pplied Mathematical Sciences, Vol. 7, 2013, no. 98, 4857-4866 HIKRI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.37389 Types of Degrees in Bipolar Fuzzy Graphs Basheer hamed Mohideen Department

arxiv:1202.5749v1 [cs.ds] 26 Feb 2012

Fixed-parameter tractability of multicut in directed acyclic graphs Stefan Kratsch Marcin Pilipczuk Micha l Pilipczuk Magnus Wahlström arxiv:1202.5749v1 [cs.ds] 26 Feb 2012 Abstract The Multicut problem,

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

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

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety