RELATIONS BETWEEN MEDIAN GRAPHS, SEMI-MEDIAN GRAPHS AND PARTIAL CUBES

Size: px
Start display at page:

Download "RELATIONS BETWEEN MEDIAN GRAPHS, SEMI-MEDIAN GRAPHS AND PARTIAL CUBES"

Transcription

1 Univrsity of Ljubljana Institut of Mathmatics, Physics an Mchanics Dpartmnt of Mathmatics Jaranska 19, 1000 Ljubljana, Slovnia Prprint sris, Vol. 36 (1998), 612 RELATIONS BETWEEN MEDIAN GRAPHS, SEMI-MEDIAN GRAPHS AND PARTIAL CUBES Wilfri Imrich Hnry Martyn Mulr Sani Klavžar Rist Škrkovski ISSN Jun 16, 1998 Ljubljana, Jun 16, 1998

2 Rlations btwn mian graphs, smi-mian graphs an partial cubs Wilfri Imrich Dpartmnt of Appli Mathmatics, Montanunivrsitat Lobn Franz-Josf Stra 18, A-8700 Lobn, Austria Sani Klavzar Dpartmnt of Mathmatics, PEF, Univrsity of Maribor Koroska csta 160, 2000 Maribor, Slovnia Hnry Martyn Mulr y Economtrisch Instituut, Erasmus Univrsitit P.O. Box 1738, 3000 DR Rottram, Th Nthrlans Rist Skrkovski z Dpartmnt of Mathmatics, Univrsity of Ljubljana Jaranska 19, 1111 Ljubljana, Slovnia Jun 16, 1998 Abstract Arich structur thory has bn vlop in th last thr cas for graphs mbabl into hyprcubs, in particular for isomtric subgraphs of hyprcubs, also known as partial cubs, an for mian graphs. Mian graphs, which constitut a propr subclass of partial cubs, hav attract consirabl attntion. In orr to bttr unrstan thm smi-mian graphs hav bn introuc but hav turn out to form a rathr intrsting class of graphs by thmslvs. This class lis strictly btwn mian graphs an partial cubs an satiss an xpansion thorm for which wgiv a slf-contain proof. Furthrmor, w show that ths graphs can b charactriz as til partial cubs an w prov that for a smi-mian graph G with n vrtics, m gs an k quivalnc classs of Djokovic's rlation, w hav 2n;m;k 2 : Morovr, quality hols if an only if G contains no K 2 2C 2t with t 2 as a subgraph. For mian graphs w show that thy can b charactriz as smi-mian graphs which contain no convx Q ; 3, i.. th 3-cub minus a vrtx, as a convx subgraph. Also, w introuc th concpt of wak 2-convxity anus it, among othr things, to prov that mian graphs ar bipartit, msh graphs with wakly 2-convx intrvals. Support by th Ministry of Scinc an Tchnology of Slovnia unr th grant J an by th SWON, th Nthrlans. y Support by th Ministry of Scinc an Tchnology of Slovnia an by th NUFFIC, th Nthrlans. z Support by th Ministry of Scinc an Tchnology of Slovnia unr th grant J

3 1 Introuction A partial cub is a connct graph that amits an isomtric mbing into a hyprcub. Th structur of partial cubs is rlativly wll unrstoo. Lt us just mntion hr thr funamntal rsults. First, Djokovic [7] charactriz ths graphs via convxity of crtain vrtx partitions. H also introuc a rlation, which was latr us by Winklr [24] to charactriz partial cubs as thos bipartit graphs for which is transitiv. As th thir rsult w mntion an xpansion thorm of Chpoi [3]. Partial cubs hav foun svral application, s, for instanc, arly rfrncs [11, 12] rlat to communication thory an rcnt applications [6, 15] to chmical graph thory. (For cint computation of s [1, 8].) A mian graph is a connct graph such that, for vry tripl of its vrtics, thr is a uniqu vrtx lying on a gosic (i.. shortst path) btwn ach pair of th tripl. By now, th class of mian graphs has bn wll invstigat an a rich structur thory is availabl, s.g. [2, 5, 17, 23]. Although mian graphs form a propr subclass of partial cubs, no nontrivial charactrization of mian graphs as partial cubs fullling som aitional conitions is known. In orr to bttr unrstan mian graphs an thir rcognition complxity, smimian graphs wr introuc in [13] as partial cubs satisfying a crtain aitional conition to b xplain in Sction 2. In th sam papr smi-mian graphs ar charactriz in a similar way as Winklr charactriz partial cubs in [24], an an xpansion thorm for smi-mian graphs was stablish. This thorm is similar to Mulr's xpansion thorm for mian graphs [18, 19] an to th on of Chpoi for partial cubs [3]. For furthr rsults on isomtric mbing an in particular on partial cubs, w rfr to [9, 10, 22]. In this papr w stuy intrrlations btwn th abov mntion classs of graphs. In th nxt sction w introuc smi-mian graphs an prsnt rsults concrning Djokovic's rlation which will b us in th squl. In Sction 3 w stuy xpansion procurs for graphs an giv a irct, slf-contain proof of th xpansion thorm for smi-mian graphs. This rsult was rst stablish in [13] with a proof bas on Chpoi's xpansion thorm for partial cubs from [3]. Morovr, as svral rsults of this papr rly on th xpansion for smi-mian graphs, w bliv that th nw tail proof is justi. In Sction 4 w introuc th concpt of wak 2-convxity an prov that mian graphs ar prcisly smi-mian graphs without convx Q ; 3. Thn w stablish a connction btwn partial cubs an smi-mian graphs by charactrizing smi-mian graphs as til partial cubs. Ths two rsults ar thn combin to scrib mian graphs as thos til partial cubs which contain no convx Q ;. 3 In Sction 6 w prov an Eulr-typ inquality for smi-mian graphs an show that th quality occurs if an only if th smi-mian graph consir contains no K 2 2C 2t with t 2 as a subgraph. This rsult is thn us to stuy th numbr of facs of a planar mian graph. W conclu th papr with two opn problms. For an arbitrary rlation w will writ for its transitiv closur. Q ; 3 stans for th graph obtain from th 3-cub by rmoving on of its vrtics. For a graph G =(V E) an X V lt hxi not th subgraph inuc by X. For u v 2 V (G) lt G (u v) not th lngth of a shortst path in G from u to v. A subgraph H ofagraphg is an isomtric subgraph, if H (u v) = G (u v) forallu v 2 V (H). 2

4 Th intrval I(u v) btwn vrtics u an v consists of all vrtics on shortst paths btwn u an v. A subgraph H of G is convx, if for any u v 2 V (H), w hav I(u v) V (H). Clarly, a convx subgraph is connct. Th Cartsian prouct G2H of graphs G an H is th graph with vrtx st V (G)V (H) an (a x)(b y) 2 E(G2H) whnvr ab 2 E(G) an x = y, or, if a = b an xy 2 E(H). Th n-cub Q n is th Cartsian prouct of n copis of th complt graph on two vrtics K 2. 2 Th rlation an smi-mian graphs Th Djokovic's rlation introuc in [7] is n on th g-st of a graph in th following way. Two gs = xy an f = uv of a graph G ar in rlation if G (x u)+ G (y v) 6= G (x v)+ G (y u) : Clarly, is rxiv an symmtric. If G is bipartit, thn can b n as follows: = xy an f = uv ar in rlation if (x u) =(y v) an (x v) =(y u) : Among bipartit graphs, is transitiv prcisly for partial cubs (i.. isomtric subgraphs of hyprcubs), as has bn prov by Winklr in [24]. Sinc mian graphs form a subclass of partial cubs, is transitiv in particular for mian graphs. In othr wors, is a congrunc on mian graphs. Lt G =(V E) b a connct, bipartit graph. For any g ab of G w writ W ab = fw 2 V j G (a w) < G (b w)g, U ab = fw 2 W ab j w has a nighbor in W ba g, F ab = f 2 E j is an g btwn W ab an W ba g : Not that, G bing bipartit, w hav V = W ab [ W ba. For any two gs uv an xy that ar in rlation, w writ uv==xy if (u x) =(v y) = (u y) ; 1 = (v x) ; 1. A st of gs is call -transitiv if any two gs in F ar in rlation. Lmma 2.1 Lt G b aconnct, bipartit graph, an lt ab b any g of G. Thn F ab is th st of all gs in rlation with ab. Proof. Lt uv b any g in F ab with u in U ab an v in U ba. Thn, by th nitions of W ab an U ab,whav (a u) =(b u) ; 1 (b v) =(a v) ; 1 (a u) : So uv an ab ar in rlation. Sinc both ns of any g in W ab ar closr to a than to b, no g in W ab can b in rlation with ab. 2 Thorm 2.2 Lt G b a connct, bipartit graph, an lt ab b an g of G. Thn th st F ab is -transitiv if an only if W ab an W ba ar convx in G. 3

5 Proof. First, lt both W ab an W ba b convx in G. Tak any two gs uv an xy in F ab with u x in U ab an v y in U ba. Thn nithr v nor y is on a u x-gosic, whnc (u x) = (u y) ; 1=(x v) ; 1. Similarly, nithr u nor x is on a v y-gosic, whnc (v y) =(u y) ; 1=(x v) ; 1. This implis that uv==xy. So F ab is -transitiv. Convrsly, lt F ab b -transitiv. First w claim that, for any gs uv an xy in F ab with ab==uv an ab==xy, w hav uv==xy. Assum th contrary, an lt uv an xy b such that (u y) is as small as possibl. Not that now w must hav uv==yx. Lt P b a u v- gosic. Sinc u is in W ab an y is in W ba, thr must b an g pq on P, going from u to y, suchthatp is in W ab an q is in W ba. So pq is in F ab. By th minimalityof(u y), w hav pq==xy, so that (p x) = (q y) = (p y) ; 1. But this is impossibl, sinc q is btwn p an y on P, an th subpath of P btwn p an y is a p y-gosic. This provs th claim. Nxt, choos any two vrtics u an v in W ab. Lt P b any u v-path that passs through W ba. Thn P must contain at last two gs of F ab. Going from u to v along P, lt xy b th rst an qp b th last g in F ab,say, with ab==xy an ab==pq. Thn w hav xy==pq, so that (x p) = (x q) +1. This implis that th subpath of P btwn x an p is not a gosic (sinc it contains q). Hnc w conclu that ach u v-gosic lis compltly in W ab. Similarly, W ba is convx. 2 Th nxt corollary is an immiat consqunc of Thorm 2.2. Corollary 2.3 Lt G b a connct, bipartit graph, an lt ab b an g of G. If F ab is -transitiv, thn F ab is a matching an inucs an isomorphism btwn hu ab i an hu ba i. A bipartit graph G is a smi-mian graph if = an th subgraph hu ab i is connct for any gab of G. Equivalntly, G is a smi-mian graph if G is a partial cub an if all th subgraphs hu ab i ar connct. Sinc in mian graphs th subgraphs hu ab i ar convx, mian graphs form a propr subclass of smi-mian graphs. Two typical smi-mian graphs ar givn in Fig. 1. (Consir two vrtics at istanc 4 from th outr 8-cycl of th scon graph to not that C 8 canbanintrval of a smi-mian graph.) u Figur 1: Smi-mian graphs 4

6 Smi-mian graphs ar charactriz in [13] as bipartit graphs for which = hols. Hr an g is in rlation to an g f if an f ar opposit gs of a squar in G or if = f. 3 Expansions, contractions an an xpansion thorm In [21] a broa schm for xpansions an contractions in graphs was prsnt. Hr w focus on on spcic instanc, th cas of smi-mian graphs. As th main rsult of this sction w prov an xpansion thorm for smi-mian graphs. This rsult has for th rst tim bn givn in [13] with a proof which rlis on th Chpoi's xpansion thorm for partial cubs, s [3, 4]. Hr w prsnt a irct, slf-contain proof of it. As a by-prouct w obtain svral rsults which might b of inpnnt intrst. Th notations w vlop in this sction will b us in th squl without furthr xplanation. Lt G =(V E) b a connct graph. For two subgraphs G 1 =(V 1 E 1 ) an G 2 =(V 2 E 2 ) of G, thintrsction G 1 \G 2 is th subgraph of G with vrtx-st V 1 \V 2 an g-st E 1 \E 2, an th union G 1 [ G 2 is th subgraph of G with vrtx-st V 1 [ V 2 an g-st E 1 [ E 2. A covr G 1, G 2 of G consists of two subgraphs G 1 an G 2 of G such that G 0 = G 1 \ G 2 is non-mpty ang = G 1 [ G 2. Not that thr ar no gs btwn G 1 ; G 2 an G 2 ; G 1. W call G 0 th intrsction of th covr. If both G 1 an G 2 ar isomtric, thn w call G 1, G 2 an isomtric covr, an if both G 1 an G 2 ar convx, thn w call G 1, G 2 a convx covr. Lt G 1, G 2 b a covr of a connct graph G with G 0 = G 1 \ G 2. Clarly, G 0 is convx if an only if both G 1 an G 2 ar convx. Not that G 1 an G 2 may both b isomtric, but not G 0 which mayvn b isconnct. Lt G 0 b a connct graph, an lt G 0 1, G 0 2 b a covr of G 0 with G 0 0 = G 0 1 \ G0 2. Th xpansion of G 0 with rspct to G 0 1, G 0 2 is th graph G construct as follows. Lt G i b an isomorphic copy of G 0 i,fori =1 2, an, for any vrtx u0 in G 0 0, lt u i b th corrsponing vrtx in G i,fori =1 2. Thn G is obtain from th isjoint union G 1 [ G 2, whr for ach u 0 in G 0 0 th vrtics u 1 an u 2 ar join by an g s Fig. 2. For xampl, if G 0 = G 0 1 = G 0 2 = Q n, thn G = Q n+1. If G 0 is a tr, an if G 0 1 = G 0 an G 0 2 consist of a singl vrtx u0 of G 0, thn G is th tr obtain from G 0 by aing a nw vrtx pning at u 0. Lt G 0i b th subgraph of G i in G corrsponing to th subgraph G 0 0 = G 0 1 \ G0 2 in G 0,fori =1 2, an lt F = F 12 b th st of gs btwn G 1 an G 2 in G, cf.fig. 2. Thn F is a matching, which inucs an isomorphism btwn G 01 an G 02 n by (u 1 )=u 2, for anygu 1 u 2 in F. Furthrmor, it follows that G 01 [G 02 togthr with F form a subgraph of G isomorphic to G 0 02K 2. Not that this notion of xpansion is call binary Cartsian xpansion in th much mor gnral stting of [21]. Th following lmma follows straightforwar from th nitions. Lmma 3.1 Lt G b th xpansion of a connct graph G 0 with rspct to th covr G 0 1 G0 2. Thn G 0 1 an G0 2 ar both isomtric in G0 if an only if G 1 an G 2 ar both convx in G. Th convrs notions to covr an xpansion ar, rspctivly, split an contraction. Lt G b a connct graph. Lt G 1 an G 2 b isjoint subgraphs of G, an lt F = F 12 b 5

7 G 0 '' $ $ '' $ ' G G 0 1 G 0 2 G 1 G 2 & & u 0 u %% & & 1 u %& 2 G 0 0 G 01 F 12 G02 $ % Figur 2: Graph G as th xpansion of G 0 with rspct to G 0 1 G0 2 th st of gs btwn G 1 an G 2, whr G 0i is th subgraph of G i consisting of th n vrtics of th gs in F, for i = 1 2. Thn G 1 G 2 is a split in G if G 1 an G 2 togthr with F form th whol of G, an F is a matching inucing an isomorphism along its gs btwn G 01 an G 02. Not that G 01 an G 02, togthr with F, form a graph isomorphic with G 01 2K 2. Th subgraphs G 1 an G 2 ar th sis of th split. In Fig. 2whav a graph G with split G 1 G 2 an a contraction G 0 with covr G 0 1 G0 2. Not that both sis of th split ar convx if an only if both sis ar isomtric. W call G 1, G 2 a convx split if both sis of th split ar convx. Now Lmma 3.1 can b altrnativly formulat as follows: if G is th xpansion of a connct graph G 0 with rspct to th covr G 0 1 G0 2, thn G 0 1, G 0 2 is an isomtric covr of G 0 if an only if G 1, G 2 is a convx split in G. Th nxt lmma follows immiatly from th nitions. Lmma 3.2 Lt G b a connct graph, an lt G 1 G 2 b a split in G. Thn G 1 G 2 is a convx split in G if an only if G 1 = hw uv i an G 2 = hw vu i for ach g uv with u in G 1 an v in G 2. Th contraction of G with rspct to th split G 1 G 2 is th graph G 0 obtain from G by contracting ach g of F to a singl vrtx. Clarly, if G is th xpansion of G 0 with rspct to th covr G 0 1, G 0 2 of G 0, thn, with th abov notation, G 1 G 2 is a split in G, an G 0 is th contraction of G with rspct to th split G 1 G 2, an vic vrsa. Nxt w stablish som basic facts about th bhaviour of subgraphs with rspct to xpansions or contractions. Lt G b th xpansion of a connct graph G 0 with rspct to th covr G 0 1, G 0 2 with G 0 0 = G 0 1 \ G0 2. Lt H 0 b an inuc subgraph of G 0 such that H 0 \ G 0 0 is nonmpty. Thn H 0 \G 0 1 H0 \G 0 2 is a covr of H 0. Lt H b th xpansion of H 0 with rspct to H 0 \G 0 1 H0 \G 0 2. Thn H is an inuc subgraph of G such that H \ G 1 H\ G 2 is a split in H an th union of H \ G 01 an H \ G 02 inucs a subgraph of G isomorphic to [H 0 \ G 0 0]2K 2. Convrsly, H 0 is th contraction of H with rspct to th split H \ G 1 H\ G 2. Clarly, H is connct 6

8 in G if an only if H 0 is connct in G 0. Th nxt lmma follows straightforwarly from th nitions. Lmma 3.3 Lt G 0 baconnct graph, lt G 0, 1 G0 banisomtric covr of 2 G0, an lt G b th xpansion of G 0 with rspct to this covr. Lt H 0 b a subgraph of G 0, an lt H b th xpansion in G with rspct to th covr H 0 \ G 0, H 0 1 \ G 0 2. Thn H is isomtric, rsp. convx, in G if an only if H 0 is isomtric, rsp. convx, in G 0. Lt G b a connct graph, an lt G 1, G 2 b a split in G whr F th st of gs btwn th sis of th split. Lt H b an inuc subgraph of G with both H \ G 1 an H \ G 2 nonmpty. Thn th subgraphs H 1 = H \ G 1 an H 2 = H \ G 2 form a split in H. Lt F H b th st of gs btwn th sis of this split in H, an lt H 0i not th ns of F H in H i, for i =1 2. Thn w hav H 0i H \ G 0i, but w o not ncssarily hav H 0i = H \G 0i,fori =1 2 cf. Fig. 3. Lt G 0 b th contraction of G with rspct to th split G 1, G 2. Thn th subgraph H 0 of G 0 prouc by this contraction is prcisly th contraction of H with rspct to th split H 1 = H \ G 1, H 2 = H \ G 2 of H. Not, howvr, that H is not ncssarily th xpansion of H 0 with rspct to H 0 \ G 0 1 an H 0 \ G 0 2. This is so bcaus H is th xpansion of H 0 with rspct to H 0 \ G 0, H 0 1 \ G 0 if an only if H 2 0i = H \ G 0i, for i =1 2. A simpl xampl is givn in Figur 3, whr H 00 is th corrsponing xpansion of H 0. ' & $ u u ' u u uu u u u %& $ G G 0 % ' & $ u ' u $ u uu u u & % G 1 G 2 G 0 1 G 0 2 H H 0 H 00 Figur 3: Expansions an contractions of subgraphs Again w sthath is connct in G if an only is H 0 is connct in G 0. 7

9 Lmma 3.4 Lt G b a connct graph, an lt G 1, G 2 baconvx split in G. Lt H b a convx subgraph of G with nonmpty H i = H \ G i, for i =1 2. If uv is an g with u in G 1 an v in G 2, thn u is in H if an only if v is in H. Proof. Not that, sinc H is convx, thr is an g xy in H with x in G 1 an y in G 2. Assum that u lis in H. By Lmma 3.2, w hav thathw vu i = hw yx i = G 2, so that v is on a gosic btwn u an y. By th convxity of H, w s that v is in H as wll. Similarly, if v lis in H, w uc that u lis in H too. 2 Th nxt corollary combins som of th abov lmmata an obsrvations. Corollary 3.5 Lt G b aconnct graph, lt G 1, G 2 baconvx split in G with contraction G 0, an lt H b a subgraph of G with th corrsponing contraction H 0. If H is convx in G thn H 0 is convx in G 0. Proof. Lt H b a convx subgraph of G, an assum that th subgraphs H \ G 01 an H \ G 02 ar nonmpty. It sucs to show that, for ach vrtx in H \ G 01, its nighbor in G 02 lis in H. Bcaus of th convxity ofh, thr xists an g xy with x in H \ G 1 an y in H \ G 2. Choos any vrtx u in H \ G 01, an lt v b its nighbor in G 02. Bcaus G 2 is convx, vry gosic btwn v an y lis in G 2. So v is on a gosic btwn u an y, whnc v is in H. Similarly, w uc that, if v is a vrtx in H \ G 2 with nighbor u in G 1, thn u is also in H. By th prvious obsrvations w infr that H 0 is also convx. 2 Thorm 3.6 Agraph is a smi-mian graph if an only if it can b obtain from th onvrtx graph K 1 by xpansions with rspct to isomtric covrs with connct intrsction. Proof. First assum that G is a smi-mian graph. W will show that G can b obtain from a smi-mian graph with fwr vrtics by an xpansion with rspct to an isomtric covr with a connct intrsction. Lt ab b any g of G, an lt G 1 = hw ab i, an G 2 = hw ba i, an G 01 = hu ab i, an G 02 = hu ba i. From Lmma 3.2, Thorm 2.2 an Corollary 3.5 it follows that G 1 G 2 is a convx split with connct G 01 an G 02. Lt G 0 b th contraction of G with rspct to this split. Thn G 0 1, G 0 2 is an isomtric covr of G 0 with nonmpty intrsction G 0 0, an G is th xpansion of G 0 with rspct to this covr. It sucs to show that G 0 is a smi-mian graph. Lt u 0 v 0 b any g of G 0, an lt uv b an g in G corrsponing to u 0 v 0, an lt H 1 = hw uv i an H 2 = hw vu i an H 01 = hu uv i an H 02 = hu vu i. Lt H 0 i b th contraction of H i, an lt H0i 0 b th contraction of H 0i, for i =1 2. Thn H 1, H 2 is a convx split in G, hnc, by Corollary 3.5, H 0 1 an H 0 2 ar convx in G 0. This implis that H 0 1 consists of all vrtics narr to u 0 than to v 0 in G 0, an that H 0 2 consists of all vrtics narr to v 0 than to u 0. Morovr, w hav in G 0 that hu uv i = H01, 0 which is connct, bcaus H 01 is. Finally, w may conclu that H1, 0 H 0 2 is a convx split in G 0,sothatthgsbtwn th sis of this split form a -transitiv -class containing th g u 0 v 0. From ths facts w conclu that G 0 is a smi-mian graph. 8

10 Convrsly, lt G b th xpansion of a smi-mian graph G 0 with rspct to an isomtric covr G 0 1 G0 2 of G 0 with connct intrsction G 0 0. Thn G 1 an G 2 ar convx in G, so that F 12 is -transitiv. Furthrmor, for any g ab in F 12, th subgraph hu ab i is connct, bcaus it is isomorphic to G 0 0. Lt uv b any g in G not in F 12, an lt u 0 v 0 b th g in G 0 corrsponing to uv. Lt H 0 = hw u 0 u 0 v 0i an H 0 = hw v 0 v 0 u 0i in G0. Thn, by Thorm (ii), H 0 an H 0 ar convx subgraphs of u 0 v 0 G0. Lt H u b th xpansion of H 0 0 u with rspct to th covr H 0 \ u 0 G0 1, H 0 \ u 0 G0 2, an, similarly, lth v b th xpansion of H 0 0 v with rspct to th covr H 0 \ v 0 G0 1, H 0 \ v 0 G0 2. Thn H u an H v ar isjoint subgraphs of G, th union of which contains all vrtics of G. By Lmma 3.3, both H u an H v ar convx in G. This implis that H u = hw uv i an H v = hw vu i. Morovr, H 0u = hu uv i an H 0v = hu vu i ar connct an match by th st of gs F uv btwn H u an H v. Hnc F uv is a -transitiv -class. From this w uc that G is a smi-mian graph as wll. 2 4 Mian graphs vrsus smi-mian graphs In this sction w charactriz mian graphs in trms of smi-mian graphs. For this purpos w stuy convxity concpts in bipartit graphs, an, in particular w introuc th notion of wakly 2-convx subgraphs. This notion also allows us to slightly strngthn on of th known charactrizations of mian graphs. Lt H b a subgraph of a graph G. Thn th of H in G is th st of all gs xy of G with x 2 H an y =2 H. Th following rsult is from [13]. Lmma 4.1 (Convxity Lmma) An inuc connct subgraph H of a bipartit graph G is convx if an only if no g is in rlation to an g in H. Lt H b an inuc connct subgraph of a graph G. Thn H is 2-convx if for any two vrtics u an v of H with G (u v) =2,vry common nighbor of u an v blongs to H. Th subgraph H is wakly 2-convx, if for any vrtics u an v of H with H (u v) =2 vry common nighbor of u an v blongs to H. Clarly, a 2-convx subgraph is a wakly 2-convx subgraph. Th convrs is not tru, consir for instanc th path on v vrtics as a subgraph of th 6-cycl C 6. A graph G =(V E) is call msh if it satiss th quarangl proprty: for any vrtics u v w z with (u v) =(u w) =(u z) ; 1 an (u v) = 2 an z a common nighbor of v an w, thr xists a common nighbor x of v an w with (u x) =(u v) ; 1. Lt G b a connct, bipartit graph, lt u b a vrtx of G an lt P = v 1! v 2!!v k b a path in G. W call th g v i v i+1 on P upwar with rspct to u if (u v i+1 )= (u v i )+1 an ownwar if (u v i+1 ) = (u v i ) ; 1. Th istanc of u to P is (u P ) = P k i=1 (u v i). Lmma 4.2 Lt G b a connct, bipartit, msh graph an lt H b a subgraph of G. Thn th following statmnts ar quivalnt: (i) H is a convx subgraph of G, (ii) H is a 2-convx subgraph of G, (iii) H is a wakly 2-convx subgraph of G. 9

11 Proof. Th implications (i) ) (ii) ) (iii) ar trivial. It rmains to prov that (iii) implis (i). Lt H b a wakly 2-convx subgraph of G an assum that H is not convx. Lt u v b vrtics in H such that I(u v) is not contain in H with (u v) = k as small as possibl. Not that k 3. By th minimality of k, thr is a u v-gosic Q of which all intrnal vrtics ar outsi H. Lt x b th nighbor of v on Q. Sinc H is connct, bing wakly 2-convx, thr xists a u v-path in H. Lt P b a path from v to u in H that minimizs th istanc from u to P. Suppos that P contains an upwar g with rspct to u. Thn thr xists a subpath p! q! r of P such that pq is upwar an qr is ownwar. Now, G bing msh, thr xists a common nighbor s of p an r with (u s) = (u p) ; 1. Sinc p! q! r lis in H, anh is wakly 2-convx, s also lis in H. But now th path P 0 obtain from P by rplacing q by s has smallr istanc to u, which crats a conict with th minimality ofp. So P contains only ownwar gs, that is, P is also a u v-gosic. Lt y b th nighbor of v on P. Thn, as G is msh, w n a common nighbor w of x an y with (u v) = (u y) ; 1 = (u v) ; 2. Sinc x is not in H, an sinc H is wakly 2-convx, w cannot b in H. Hnc I(u y) is not contain in H, which is impossibl by th minimality ofk = (u v). 2 Not that a graph is msh if vry tripl of vrtics has a mian. Hnc, by Lmma 4.2, w hav th following rsult. Corollary 4.3 Lt G b a connct, bipartit, graph in which vry tripl of vrtics has a mian. Thn a subgraph H of G is convx if an only if H is 2-convx. Corollary 4.3 is givn in [14] in a wakr form, stating that convx is quivalnt to isomtric an 2-convx. In [17] it is prov that a graph G is a mian graph if an only if G is a bipartit, msh graph with 2-convx intrvals. Thus, from Lmma 4.2 w also infr th following charactrization of mian graphs: Corollary 4.4 Lt G b aconnct graph. Thn G is amian graph if an only if G is a bipartit, msh graph with wakly 2-convx intrvals. Almost-mian graphs wr introuc in [13] as partial cubs for which th subgraph hu ab i is isomtric for any gab of G anitwas prov that a graph is a mian graph if an only if it is an almost-mian graph which contains no convx Q ; 3 as a subgraph. W ar now abl to strngthn this rsult as follows. Thorm 4.5 A graph G is a mian graph if an only if G is a smi-mian graph an contains no convx Q ; 3 as a subgraph. Proof. Clarly, a graph which contains a convx Q ; 3 cannot b a mian graph. Suppos G is a smi-mian graph which contains no convx Q ; 3. Thn G can b construct from th 1-vrtx graph by a sris of connct xpansions. If ths xpansions ar also convx, w obtain a mian graph. Thus, thr must b a rst xpansion stp which 10

12 las to a non-mian graph. Sinc all graphs construct up to this stp ar mian graphs, this xpansion cannot b convx by Mulr's convx xpansion thorm. To mak notation asir, lt us assum for th tim bing that th last xpansion stp is th only on not convx in hw uv i. As hw uv i is a mian graph, U uv cannot b 2-convx ithr by Corollary 4.3. Thus, thr is a squar consisting of th gs ab bc c a in hw uv i whr a b c ar in U uv, but not. Lt a 0 b 0 c 0 b th nighbors of a b c in U vu. Thn a b c a 0 b 0 c 0 form a convx Q ; 3 in G, which raily follows from th Convxity Lmma 4.1. If this is not th last xpansion stp, w not that all furthr connct xpansions a gs which blong to irnt -classs from all prvious ons, so this Q ; 3 rmains convx by Lmma Mian graphs vrsus partial cubs In this sction w will answr th qustion which aitional conitions a partial cub must satisfy in orr to b a mian graph. For this sak w rst stuy th intrrlation of partial cubs with smi-mian graphs. An vn graph is a graph whos vry vrtx has vn gr. Rcall that nots th symmtric sum of graphs, whr w consir graphs as sts of gs. Lt C b a cycl of a graph G. Thn a st of 4-cycls C = fc 1 C 2 ::: C p g in G is a tiling of H if H = C 1 C 2 C p : Call a graph G til if vry cycl of G has a tiling. This nition nabls us to formulat th following rsult about partial cubs an smi-mian graphs. Thorm 5.1 A graph is a smi-mian graph if an only if it is a til partial cub. Proof. Lt G b a til partial cub which is not a smi-mian graph. Sinc G is not a smi-mian graph, thr xists an g ab 2 E(G) such that hu ab i (an hu ba i) is not connct. Lt hu 1 i an hu 2 i b two irnt connct componnts of hu ab ab abi an lt hu 1 i ba an hu 2 i b th appropriat connct componnts of hu ba bai. Lt u 1 v 1 an u 2 v 2 b gs from F ab with u i 2 hu i i an v ab i 2 hu i i for i = 1 2. W may assum that u ba 1 an u 2 ar as clos as possibl unr th abov assumptions. Thn thr is an inuc (in fact vn isomtric) cycl C = u 1 Pu 2 v 2 Qv 1 u 1 of G such that th paths P an Q li in W ab n U ab an W ba n U ba, rspctivly. Obsrv rst that th lngth of C is at last 6. Sinc G is til, thr xists a st of cycls C = fc 1 ::: C p g (p 2) of G such that C = C 1 C p. Not that if th 4-cycl C i has an g in F ab, thn it has xactly two gs in F ab. Sinc u 1 v 1 an u 2 v 2 ar th only two gs of C which ar in F ab thr xists a subst C r = fc i1 ::: C ir g of C, whr vry C ij has two gs in F ab an F ab \E(C i1 C ir )=fu 1 v 1 u 2 v 2 g. But thn w obsrv that in C i1 C ir thr is an u 1 u 2 -path with all innr vrtics in hu ab i. This is a contraiction, for w assum that ths two vrtics ar in irnt connct componnts of hu ab i. Suppos now thatg is a smi-mian graph. Thn G is a partial cub. W n to show that G is til. Th proof is by inuction on th numbr of -classs of G. If thr is no 11

13 such class thn G is th on vrtx graph, which istil. Now, lt G b a smi-mian graph with at last on -class. Thn G can b obtain by a connct xpansion stp from a smi-mian graph G 0, which is til by th inuction hypothsis. Lt F ab b th -class obtain in th xpansion stp. Suppos that C is an arbitrary cycl of G. W will prov that C is til by inuction on je(c) \ F ab j. Lt C 0, W 0, an W 0 corspon in ab ba G0 to C, W ab,anw ba, rspctivly. Suppos rst that je(c) \ F ab j =0. Thn w may assum that C is a cycl of hw ab i. By th inuction hypothsis thr is a tiling C 0 = fc 0 1 ::: C0 pg of C 0 in G 0. Lt C 0 b b th st of 4-cycls of C 0 which hav avrtx in W 0 n W 0 an lt ba ab C0 a = C 0 nc 0. b Lt C b b th st of 4-cycls in hw ba i which naturally corspon to th 4-cycls of C 0. b Similarly, lt C a b th st of 4-cycls in hw ab i which corspon to th 4-cycls of Ca. 0 St C = C a [C b. Not that th graph H b = D2Cb D is an vn subgraph of U ba. Lt H a b th isomorphic copy inu ab of H b. Sinc C 0 = C 0 C0 1 p, it follows that H a = C D2Ca D: (1) Lt C ab b th st of 4-cycls D = cfc such that c 2 H a, f 2 H b, an fc 2 F ab. Sinc H a an H b ar vn graphs, by (1),w conclu that C a [C b [C ab is a tiling of C in G. Assum nxt that E(C) \ F ab = fu 1 v 1 u 2 v 2 g, whr u 1 u 2 2 U ab an v 1 v 2 2 U ba. Lt P u b an arbitrary path in hu ab i btwn u 1 an u 2. Dnot by P v th isomorphic copy of P u in hu ba i. Not that P u an P v always xist sinc hu ab i an hu ba i ar connct graphs as G is a smi-mian graph. Lt H = P u [ P v [fu 1 v 1 u 2 v 2 g. Thn H is a cycl an it is asy to s that thr xists a tiling C H such thatach 4-cycl of C H has two gs in F ab, on in P u an on in P v. Not that w can consir th vn graph C H as a st of pairwis g isjoint cycls (possibly mpty st)such that ach on is ithr in hw ab i or hw ba i. Thus, by th prvious cas, for ach such cycl D 2 C H thr xists a tiling C D. Lt C CH = D2CH C D : (2) Now it is asy to s that C CH is a tiling of C H: Finally, obsrv that C CH [C H is a tiling of C. Suppos now that E(C) \ F ab = fu 1 v 1 ::: u 2t v 2t g (t 2) an that vry cycl D of G with jf ab \ Dj < 2t is til. Th argumnt is basically th sam as th prvious on. W may assum that thr is a path P u btwn u 1 an u 2 in C n F ab. Lt P v b an arbitrary path in hu ba i btwn v 1 an v 2. Lt H = P u [ P v [fu 1 v 1 u 2 v 2 g. Sinc je(h) \ F ab j =2,it follows by th abov that thr xists a tiling C H for H. Similarly as abov consir th vn graph C H as a st of cycls such that ach on has at most 2(t ; 1) gs from F ab. Thus for ach cycl D 2 C H thr xists a tiling C D. Lt C CH b n as in (2). Thn, as abov whav thatc CH is a tiling of C H an hnc C CH [C H is a tiling of C. 2 Combining Thorm 5.1 with Thorm 4.5 w obtain th following charactrization of mian graphs as partial cubs. Corollary 5.2 A graph G is a mian graph if an only if G is a til partial cub which contains no convx Q ; 3. 12

14 6 An Eulr-typ formula for smi-mian graphs Lt G b a mian graph with n vrtics, m gs an k quivalnc classs of th rlation. It was prov in [16] that 2n ; m ; k 2, an that quality hols if an only if G is a cub-fr mian graph. Th purpos of this sction is to xtn this Eulr-typ rsult to smi-mian graphs. For this sak w n th following corollary to Thorm 3.6. Corollary 6.1 A graph is a (K 2 2C 2t )-fr smi-mian graph, t 2, if an only if it can b obtain from th on vrtx graph by a connct xpansion procur, in which vry xpansion stp is takn with rspct to a covr with a tr as intrsction. Proof. Lt G b a (K 2 2C 2t )-fr smi-mian graph which isaconnct xpansion of G 0 with rspct to G 0 1 an G 0 2. Thn G 0 0 = G 0 1 \ G0 2 contains no cycl bcaus G is (K 2 2C 2t )- fr. Morovr, as G is a smi-mian graph, G 0 0 is connct an hnc a tr. Inuction complts th argumnt. Convrsly, assum that G can b obtain from th on vrtx graph by a connct xpansion procur, in which vry xpansion stp is takn with rspct to a covr with a tr as intrsction. By th xpansion thorm G is a smi-mian graph an w show by inuction that G is (K 2 2C 2t )-fr. Lt G b obtain from G 0 with rspct to G 0 1 an G 0 2 by an xpansion stp. As G 0 is a (K 2 2C 2t )-fr graph, G can only contain an inuc K 2 2C 2t which intrscts both G 1 an G 2. Each 4-cycl K 2 2K 2 as a subgraph of K 2 2C 2t has two vrtics in G 1 an two ing 2. But thn w conclu that C 2t is a subgraph of G 1 an of G 2, thus G 0 1 \ G0 2 is not a tr, a contraiction. 2 W cannow stat th main rsult of this sction. Thorm 6.2 Lt G b a smi-mian graph with n vrtics, m gs an lt k b th numbr of quivalnc classs of. Thn 2n ; m ; k 2 : Morovr, 2n ; m ; k =2if an only if G contains no K 2 2C 2t with t 2 as a subgraph. Proof. W prov th inquality by inuction on th numbr of vrtics using Thorm 3.6. Th inquality rucs to 2 2ifG = K 1. So assum that G is th connct xpansion of th smi-mian graph G 0 with rspct to its isomtric subgraphs G 0 1, G 0 2 with G 0 0 = G 0 1 \G0 2. By inuction w hav 2n 0 ; m 0 ; k 0 2 for G 0, whr k 0, n 0, m 0 ar th corrsponing paramtrs of G 0. Lt t b th numbr of vrtics in G 0 0,sothatG 0 0, bing connct, has at last t ; 1 gs. Thn w hav n = n 0 + t an m m 0 +2t ; 1. Morovr, an xpansion stp yils on mor -quivalnc class an so w hav k = k Thus 2n ; m ; k 2(n 0 + t) ; (m 0 +2t ; 1) ; (k 0 +1) = 2n 0 ; m 0 ; k 0 2 : Clarly, w hav quality if an only if, all th xpansions hav bn takn with rspct to two isomtric subgraphs having a tr as intrsction. By Corollary 6.1, this is quivalnt with G bing a (K 2 2C 2t )-fr smi-mian graph. 2 13

15 Corollary 6.3 Lt G b a planar smi-mian graph with n vrtics, k quivalnc classs of th rlation an f facs in its planar mbing. Thn f n ; k. Morovr, f = n ; k if an only if G is (K 2 2C 2t )-fr. Proof. Combin th Eulr's formula n ; m + f = 2 with Thorm Two problms At th n of th papr w wish to stat th following two problms. Problm 7.1 Is vry rgular partial cub a Cartsian prouct of vn cycls an K 2 's? Problm 7.2 Is vry rgular smi-mian graph a hyprcub? Rcall that Mulr [20] sttl th lattr qustion armativly for mian graphs. Not also that th answr is ngativ for partial cubs (consir C 6 ). Finally, obsrv that by Thorm 5.1, th truth of th rst problm implis th truth of th scon on. Rfrncs [1] F. Aurnhammr an J. Hagaur, Computing quivalnc classs among th gs of a graph with applications, Discrt Math. 109 (1992), 3{12. [2] H.-J. Banlt, Rtracts of hyprcubs, J. Graph Thory 8 (1984), 501{510. [3] V. Chpoi, -Convxity an isomtric subgraphs of Hamming graphs, Cybrntics 1(1988), 6{9. [4] V. Chpoi, Sparation of two convx sts in convxity structurs, J. Gom. 50 (1994), 30{51. [5] F.R.K. Chung, R.L. Graham, an M.E. Saks, Dynamic sarch in graphs, in: Discrt Algorithms an Complxity (H. Wilf,.) (Acamic Prss, Nw York, 1987), 351{387. [6] V. Chpoi an S. Klavzar, Th Winr inx an th Szg inx of bnznoi systms in linar tim, J. Chm. Inf. Comput. Sci. 37 (1997), 752{755. [7] D. Djokovic, Distanc prsrving subgraphs of hyprcubs, J. Combin. Thory Sr. B 14 (1973), 263{267. [8] T. Fr, Prouct graph rprsntations, J. Graph Thory 16 (1992), 467{488. [9] R. L. Graham, Isomtric mbings of graphs, in: Slct Topics in Graph Thory III, (L.W. Bink an R.J. Wilson, s.) (Acamic Prss, Lonon, 1988), 133{150. [10] R. L. Graham an P. M. Winklr, On isomtric mbings of graphs, Trans. Amr. Math. Soc. 288 (1985), 527{

16 [11] R. Graham an H. Pollak, On th arssing problm for loop switching, Bll Systm Tch. J. 50 (1971), 2495{2519. [12] R. Graham an H. Pollak, On mbing graphs in squash cubs, in: Graph Thory an Applications, Lctur Nots in Math., Vol. 303 (Springr, Nw York, 1972) 99{110. [13] W. Imrich an S. Klavzar, A convxity lmma an xpansion procurs for bipartit graphs, Europan J. Combin., in prss. [14] P.K. Jha, G. Slutzki, Convx-xpansion algorithms for rcognizing an isomtric mbing of mian graphs, Ars Combin. 34 (1992), 75{92. [15] S. Klavzar, I. Gutman, an B. Mohar, Labling of bnznoi systms which rcts th vrtx{istanc rlations, J. Chm. Inf. Comput. Sci. 35 (1995), 590{593. [16] S. Klavzar, H.M. Mulr an R. Skrkovski, An Eulr-typ formula for mian graphs, Discrt Math. 187 (1998), 255{258 [17] S. Klavzar an H.M. Mulr, Mian graphs: charactrizations, location thory an rlat structurs, J. Combin. Math. Combin. Comp., in prss. [18] H.M. Mulr, Th structur of mian graphs, Discrt Math. 24 (1978), 197{204. [19] H.M. Mulr, Th Intrval Function of a Graph (Mathmatical Cntr Tracts 132, Mathmatisch Cntrum, Amstram, 1980). [20] H.M. Mulr, n-cubs an mian graphs, J. Graph Thory 4 (1980), 107{110. [21] H.M. Mulr, Th xpansion procur for graphs (in: R. Bonik (.), Contmporary Mthos in Graph Thory, Wissnschaftsvrlag, Mannhim, 1990) 459{477. [22] E. Wilkit, Isomtric mbings in Hamming graphs, J. Combin. Thory Sr. B 50 (1990), 179{197. [23] E. Wilkit, Th rtracts of Hamming graphs, Discrt Math. 102 (1992), 197{218. [24] P. Winklr, Isomtric mbings in proucts of complt graphs, Discrt Appl. Math. 7 (1984), 221{

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

On spanning trees and cycles of multicolored point sets with few intersections

On spanning trees and cycles of multicolored point sets with few intersections On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction

More information

Thickness and Colorability of Geometric Graphs

Thickness and Colorability of Geometric Graphs Thicknss an Colorability o Gomtric Graphs Stphan Durochr 1 Dpartmnt o Computr Scinc, Univrsity o Manitoba, Winnipg, Canaa Elln Gthnr Dpartmnt o Computr Scinc, Univrsity o Colorao Dnvr, Colorao, USA Dbajyoti

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

PROBLEM SET Problem 1.

PROBLEM SET Problem 1. PROLEM SET 1 PROFESSOR PETER JOHNSTONE 1. Problm 1. 1.1. Th catgory Mat L. OK, I m not amiliar with th trminology o partially orr sts, so lt s go ovr that irst. Dinition 1.1. partial orr is a binary rlation

More information

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

10. EXTENDING TRACTABILITY

10. EXTENDING TRACTABILITY Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

CS 491 G Combinatorial Optimization

CS 491 G Combinatorial Optimization CS 49 G Cobinatorial Optiization Lctur Nots Junhui Jia. Maiu Flow Probls Now lt us iscuss or tails on aiu low probls. Thor. A asibl low is aiu i an only i thr is no -augnting path. Proo: Lt P = A asibl

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

64. A Conic Section from Five Elements.

64. A Conic Section from Five Elements. . onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an

More information

Chapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover

Chapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover Coping With NP-Compltnss Chaptr 0 Extning th Limits o Tractability Q. Suppos I n to solv an NP-complt problm. What shoul I o? A. Thory says you'r unlikly to in poly-tim algorithm. Must sacriic on o thr

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

More information

CS 361 Meeting 12 10/3/18

CS 361 Meeting 12 10/3/18 CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm

More information

First order differential equation Linear equation; Method of integrating factors

First order differential equation Linear equation; Method of integrating factors First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices

Finding low cost TSP and 2-matching solutions using certain half integer subtour vertices Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,

More information

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall Staning Wav Intrfrnc btwn th incint & rflct wavs Staning wav A string with on n fix on a wall Incint: y, t) Y cos( t ) 1( Y 1 ( ) Y (St th incint wav s phas to b, i.., Y + ral & positiv.) Rflct: y, t)

More information

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list. 3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if

More information

Strongly Connected Components

Strongly Connected Components Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,

More information

Mutually Independent Hamiltonian Cycles of Pancake Networks

Mutually Independent Hamiltonian Cycles of Pancake Networks Mutually Indpndnt Hamiltonian Cycls of Pancak Ntworks Chng-Kuan Lin Dpartmnt of Mathmatics National Cntral Univrsity, Chung-Li, Taiwan 00, R O C discipl@ms0urlcomtw Hua-Min Huang Dpartmnt of Mathmatics

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th

More information

Objective Mathematics

Objective Mathematics x. Lt 'P' b a point on th curv y and tangnt x drawn at P to th curv has gratst slop in magnitud, thn point 'P' is,, (0, 0),. Th quation of common tangnt to th curvs y = 6 x x and xy = x + is : x y = 8

More information

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j)

INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS. xy 1 (mod p), (x, y) I (j) INCOMPLETE KLOOSTERMAN SUMS AND MULTIPLICATIVE INVERSES IN SHORT INTERVALS T D BROWNING AND A HAYNES Abstract W invstigat th solubility of th congrunc xy (mod ), whr is a rim and x, y ar rstrictd to li

More information

Figure 1: Closed surface, surface with boundary, or not a surface?

Figure 1: Closed surface, surface with boundary, or not a surface? QUESTION 1 (10 marks) Two o th topological spacs shown in Figur 1 ar closd suracs, two ar suracs with boundary, and two ar not suracs. Dtrmin which is which. You ar not rquird to justiy your answr, but,

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012

The van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012 Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES

A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES ADRIAAN DANIËL FOKKER (1887-197) A translation of: Ein invariantr Variationssatz für i Bwgung mhrrr lctrischr Massntilshn Z. Phys. 58, 386-393

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

That is, we start with a general matrix: And end with a simpler matrix:

That is, we start with a general matrix: And end with a simpler matrix: DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss

More information

CLONES IN 3-CONNECTED FRAME MATROIDS

CLONES IN 3-CONNECTED FRAME MATROIDS CLONES IN 3-CONNECTED FRAME MATROIDS JAKAYLA ROBBINS, DANIEL SLILATY, AND XIANGQIAN ZHOU Abstract. W dtrmin th structur o clonal classs o 3-connctd ram matroids in trms o th structur o biasd graphs. Robbins

More information

G. Gambosi (*), J. Ne~etgil (**), M. Talamo (*)

G. Gambosi (*), J. Ne~etgil (**), M. Talamo (*) EFFICIENT REPRESENTATION OF TAXONOMIES G. Gamosi (*), J. N~tgil (**), M. Talamo (*) (*) Istituto i Analisi i Sistmi Inormatica l C.N.R.~ Vial Manzoni 30, 00185, Roma,Italy (**) Charls Univrsity Malostransk~

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thomas Whitham Sith Form Pur Mathmatics Cor rvision gui Pag Algbra Moulus functions graphs, quations an inqualitis Graph of f () Draw f () an rflct an part of th curv blow th ais in th ais. f () f () f

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

Deift/Zhou Steepest descent, Part I

Deift/Zhou Steepest descent, Part I Lctur 9 Dift/Zhou Stpst dscnt, Part I W now focus on th cas of orthogonal polynomials for th wight w(x) = NV (x), V (x) = t x2 2 + x4 4. Sinc th wight dpnds on th paramtr N N w will writ π n,n, a n,n,

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

Inference Methods for Stochastic Volatility Models

Inference Methods for Stochastic Volatility Models Intrnational Mathmatical Forum, Vol 8, 03, no 8, 369-375 Infrnc Mthods for Stochastic Volatility Modls Maddalna Cavicchioli Cá Foscari Univrsity of Vnic Advancd School of Economics Cannargio 3, Vnic, Italy

More information

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.

Thus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases. Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn

More information

Mathematics 1110H Calculus I: Limits, derivatives, and Integrals Trent University, Summer 2018 Solutions to the Actual Final Examination

Mathematics 1110H Calculus I: Limits, derivatives, and Integrals Trent University, Summer 2018 Solutions to the Actual Final Examination Mathmatics H Calculus I: Limits, rivativs, an Intgrals Trnt Univrsity, Summr 8 Solutions to th Actual Final Eamination Tim-spac: 9:-: in FPHL 7. Brought to you by Stfan B lan k. Instructions: Do parts

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

Online Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand

Online Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand Onlin Supplmnt Avanc Slling in a Supply Cain unr Uncrtain Supply an Dman. Proos o Analytical sults Proo o Lmma. Using a = minl 0 ; x g; w can rwrit () as ollows (x ; w ; x ; w ) = a +(m0 w )a +( +" x w

More information

SPH4U Electric Charges and Electric Fields Mr. LoRusso

SPH4U Electric Charges and Electric Fields Mr. LoRusso SPH4U lctric Chargs an lctric Fils Mr. LoRusso lctricity is th flow of lctric charg. Th Grks first obsrv lctrical forcs whn arly scintists rubb ambr with fur. Th notic thy coul attract small bits of straw

More information

1 Isoparametric Concept

1 Isoparametric Concept UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)

More information

Exercise 1. Sketch the graph of the following function. (x 2

Exercise 1. Sketch the graph of the following function. (x 2 Writtn tst: Fbruary 9th, 06 Exrcis. Sktch th graph of th following function fx = x + x, spcifying: domain, possibl asymptots, monotonicity, continuity, local and global maxima or minima, and non-drivability

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 10. The singular integral Introducing S(n) and J(n) Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

Lecture 6.4: Galois groups

Lecture 6.4: Galois groups Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16.

4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16. . 7 7 7... 7 7 (n )0 7 (M) 0(n ) 00 n (A) S ((7) 0(0)) (M) (7 00) 8897 (A). (5a b) 7 7... (5a)... (M) 7 5 5 (a b ) 5 5 a b (M)(A) So th cofficint is 75 (A) (C) [] S (7 7) (M) () 8897 (A) (C) [] 5. x.55

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thomas Whitham Sith Form Pur Mathmatics Unit C Algbra Trigonomtr Gomtr Calculus Vctor gomtr Pag Algbra Molus functions graphs, quations an inqualitis Graph of f () Draw f () an rflct an part of th curv

More information

arxiv: v2 [cs.dm] 17 May 2018

arxiv: v2 [cs.dm] 17 May 2018 Inhritanc of Convxity for th P min -Rstrictd Gam arxiv:708.0675v [cs.dm] 7 May 08 A. Skoda July 6, 08 Abstract W considr rstrictd gams on wightd graphs associatd with minimum partitions. W rplac in th

More information

Weak Unit Disk and Interval Representation of Graphs

Weak Unit Disk and Interval Representation of Graphs Wak Unit Disk and Intrval Rprsntation o Graphs M. J. Alam, S. G. Kobourov, S. Pupyrv, and J. Toniskottr Dpartmnt o Computr Scinc, Univrsity o Arizona, Tucson, USA Abstract. W study a variant o intrsction

More information

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

ECE602 Exam 1 April 5, You must show ALL of your work for full credit. ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b

More information

von Neumann-Wigner theorem: level s repulsion and degenerate eigenvalues.

von Neumann-Wigner theorem: level s repulsion and degenerate eigenvalues. von Numann-Wignr thorm: lvl s rpulsion an gnrat ignvalus. Yu.N.Dmkov an P.Kurasov Abstract. Spctral proprtis of Schröingr oprators with point intractions ar invstigat. Attntion is focus on th intrplay

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

More information

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d Aitional Math (07) Prpar b Mr Ang, Nov 07 Fin th valu of th constant k for which is a solution of th quation k. [7] Givn that, Givn that k, Thrfor, k Topic : Papr (00 marks) Tim : hours 0 mins Nam : Aitional

More information

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.

Fourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation. Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform

More information

A Propagating Wave Packet Group Velocity Dispersion

A Propagating Wave Packet Group Velocity Dispersion Lctur 8 Phys 375 A Propagating Wav Packt Group Vlocity Disprsion Ovrviw and Motivation: In th last lctur w lookd at a localizd solution t) to th 1D fr-particl Schrödingr quation (SE) that corrsponds to

More information

First derivative analysis

First derivative analysis Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points

More information

UNTYPED LAMBDA CALCULUS (II)

UNTYPED LAMBDA CALCULUS (II) 1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /

More information

Some remarks on Kurepa s left factorial

Some remarks on Kurepa s left factorial Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).

More information

On Grids in Topological Graphs

On Grids in Topological Graphs On Grids in Topological Graphs Eyal Ackrman Dpartmnt of Computr Scinc Fri Univrsität Brlin Takustr. 9, 14195 Brlin, Grmany yal@inf.fu-brlin.d Jacob Fox Dpartmnt of Mathmatics Princton Univrsity Princton,

More information

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems

Roadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization

More information

Differential Equations

Differential Equations Prfac Hr ar m onlin nots for m diffrntial quations cours that I tach hr at Lamar Univrsit. Dspit th fact that ths ar m class nots, th should b accssibl to anon wanting to larn how to solv diffrntial quations

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R. Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood

More information

1973 AP Calculus AB: Section I

1973 AP Calculus AB: Section I 97 AP Calculus AB: Sction I 9 Minuts No Calculator Not: In this amination, ln dnots th natural logarithm of (that is, logarithm to th bas ).. ( ) d= + C 6 + C + C + C + C. If f ( ) = + + + and ( ), g=

More information

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then

[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then SYSTEM PERFORMANCE Lctur 0: Stady-tat Error Stady-tat Error Lctur 0: Stady-tat Error Dr.alyana Vluvolu Stady-tat rror can b found by applying th final valu thorm and i givn by lim ( t) lim E ( ) t 0 providd

More information

Calculus concepts derivatives

Calculus concepts derivatives All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving

More information

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark.

Note If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark. . (a) Eithr y = or ( 0, ) (b) Whn =, y = ( 0 + ) = 0 = 0 ( + ) = 0 ( )( ) = 0 Eithr = (for possibly abov) or = A 3. Not If th candidat blivs that = 0 solvs to = 0 or givs an tra solution of = 0, thn withhold

More information

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS

ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A3 ON THE DISTRIBUTION OF THE ELLIPTIC SUBSET SUM GENERATOR OF PSEUDORANDOM NUMBERS Edwin D. El-Mahassni Dpartmnt of Computing, Macquari

More information

Minimum Spanning Trees

Minimum Spanning Trees Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst

More information

u 3 = u 3 (x 1, x 2, x 3 )

u 3 = u 3 (x 1, x 2, x 3 ) Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.

More information

Coupled Pendulums. Two normal modes.

Coupled Pendulums. Two normal modes. Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron

More information

ph People Grade Level: basic Duration: minutes Setting: classroom or field site

ph People Grade Level: basic Duration: minutes Setting: classroom or field site ph Popl Adaptd from: Whr Ar th Frogs? in Projct WET: Curriculum & Activity Guid. Bozman: Th Watrcours and th Council for Environmntal Education, 1995. ph Grad Lvl: basic Duration: 10 15 minuts Stting:

More information

Recounting the Rationals

Recounting the Rationals Rconting th Rationals Nil Calkin and Hrbrt S. Wilf pril, 000 It is wll known (indd, as Pal Erd}os might hav said, vry child knows) that th rationals ar contabl. Howvr, th standard prsntations of this fact

More information

Separating principles below Ramsey s Theorem for Pairs

Separating principles below Ramsey s Theorem for Pairs Sparating principls blow Ramsy s Thorm for Pairs Manul Lrman, Rd Solomon, Hnry Towsnr Fbruary 4, 2013 1 Introduction In rcnt yars, thr has bn a substantial amount of work in rvrs mathmatics concrning natural

More information