Scribd Logo
Upload

Welcome to Scribd!

  • CH 09

    Uploaded by

    Jonah
    18 views11 pages

    Original Title

    ch09

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    18 views11 pages

    CH 09

    Uploaded by

    Jonah

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 11
    ssi (A,.A:)9(8) 9By)= 0,25. The subset relation is @ Patil ordering on any collection of es, because ti reflex ie, ansymmetri, and wansitive, Here the oleton of ets isR(S). 27 Find recipe ~ Buy seafood ~ Buy groceries = Wash sellish < Cut ginger and gate ~ Clean fish = Scam rice < Cut sh < Wash vegetables < Chap water chestnuts ~ Make gumishes ~ Cook in wok ~ Arrange on platter < Serve 29a) The only anticain with more than one ee iment is (nd). b) The only antichsins wth more than one element ar), f,¢) and (de). €) The aly antichins withmorethan one element are (abl (2,e}, be), ch, del td, fife, and (de. f). MeLaUS, <) bea nite post, and let A be a maximal chin. Because (4, =) is also a pose it must havea minimal element m. Suppose that isot misma in . Then there would Be an lento (of S with a <2m. However, this would make the set A fa) a larger chi han A, To show this, we must show that is comparable with every’ clement ofA. Because m fs compara ‘ie with every element ofA and m is minimal allows that im POI -» Pls) then Pais tue forall x © St does not hold that x) is tue forall 6 5, les bean element of $ such hat P(;) i ot ‘Tren bythe conditional statement already give, i mist be the case that ¥ P()] is ota This means hat theres some x; with ay ~ x sich tit P() isnot ee ‘Aguin invoking the conditional statement, we get an 25 <2 ‘och that Pay) ot ts, and 0 on forever. This conte dics the well oundeness of our poset, Therefore, PCs) is true forall € 5. 37. Soppose that is a quasorering. Because fis reflexive, ifa © A, then (a, a) R. Tis im Plies that (a, a) € R-! Hence, a'& RR I follows hat ROR isrellexive RR issymmetc for any relation ‘because, for any relation Rif (a,b) € Rthen(b,)€ R* andvice vers To show that 0 Ristranstve,supposethat (a,b) ROR” and (6,c)€ RNR"! Because (5) € R and (6,0) R, (ase) ER, because R is transive, Simi Tay, beens (5) € R-" nd Pye) € R,(b,a) € Rand (.b) €R. 30 (6a) €R and (a,c) € Rt. Hence, (2,¢) & ROR. I follows that RVR" isan equivalence rela: tion 39.) Because ltr, ») = gb). *) and lab, 9) = lub), i follows that x Ay'=y ax and xv y= yx 1b) Using the definition, (& 3) 42 8a lower bound of, and z tht is grater than every oer lower bound. Becase “and: play interchangeable oes, x © (42) isthe same clement Similan, (xv) v isan upper bound of, an tats ess than ever ther upper bound. ease, ad play interehangeableroles,xv ( 2)sthe same element ¢) To show thats» (x v9) = itis sufceno show that ‘sth greatest lover bound of x, and.x vy. Noe that xfs 4 lower bound oft, and becuse + vy is by defiton pester ‘Answers 04d Numbered Exercises S83 in x, «fs. lower Bound fo ita wel, Therefore, is & Tower bound. But any lover bound of x has to be ese than 1, so. isthe greatest lower bound, The second statement is the Aha ofthe fst; we omits proof). 6a lomet, and an upper, bound fr itself and isl, and the greats, and east, such hound. a) Because 1 is the only element greater than or equal 1 itis the ony upper bound for I and there forthe only posible vale of the east upper bound of nd 1. by Because x < Iris lower bound for both + and 1 and no other ower bound can be greater han x80 0 ©) Because = xx isan upper bound forbohs and anno ‘er bound canbe ess thanx, 50 v0 =.) Because 0 Jsthe ony clement ess han oF ea 0, tis the only lower tour ford andthereforethe onl posible vale ofthe retest lowerbound os and0. 43. =(8,<) where §= (01) (21,08, 11,2) 2.3). (1.2.3)) 48. Yes 47. Thecomple- met ofa Subset X © S's ts complement § —X. To prove this, note that Xv (S—X)= and X a (8 —X) =O be- cause XU(S—X)=S and XS X)= 49. Think ofthe rectangular grid a8 representing elements in a mri, ‘Thus we number fom top to btm abd within that fom le ‘orig. The patil orders that (a,b) = (c,d) ff@ = and = d.Noethat (I, 1)sthe least element under his reaion, ‘The ules for Chonp as explained in Chapter | eon with therules state inthe preamble hee, Butnow we can identify the point. b) with he atural number py! fra and with | sa mand |= b =. This dents the point in ‘he rectangular rd with he st S inthis eerie, andthe pa ta onder = jst desribed isthe same asthe divides relation, because pg? | pg!" rand only if the exponent on onthe left doesnt exced the exponent ofp onthe right, fd ily forg CHAPTER 9 Section 9.1 Lay Beso ew Nowak Washing S54 Answers Odd Numered Escrcss Simple graph 7. Directed graph 9. Dretedmulligrgh I. If wR, then there san edge associated wth a, But (, »} = [fo aso this edge i = sociated wit vu) and therefore vu. Thus, by definition, isa symmetic elation. A simple graph does not allow loops therefore, wu never holds and so by definition Ris ineexive 5. Preudogrph o yk hi emits Rain "Se can Mec y Nab ss 1, Meggme 7 23, Wefindshe telephone numbers inthe call raph for Febro- ‘ny that ae nt presenti the call graph for Janary at vie ‘ers. For each number we find we make a is ofthe nu bers they called or were called by using the edges inthe cll trph. We examine thes list to find new telephone numbers in February hat bad similar eallng patterns to defunct tee hone number in January. 28. We seth raph mode that has e-mail adeses as veries and foreach message en, an edge fom the eal aes ofthe sender tothe e-mail ad- Ares ofthe repent. For each e-mail aes, we can make & list of ther adresses they sent messages to anda of eher addres frm which thy received messages. Iwo eal ad ress had almost the Same pater, we conclude that these addresses might have belonged to the same person who bad recenlychangedhisorhecemailaddrest. 27. LetVbethe set of people at the party. Let E be the set of erred pis 55 (4,0) nV 2 V such that w knows v's name. Te edges are Airceted, bu mpl edges arent allowed Literally, hte is ‘loop at each vere, bu or simplicity, the model could omit the loops. 29, Let the seta vertices beast of people, and to vertices arejoind by an de ithe wo people were ever ‘marted. Inaring complications, his eraph asthe property that there are two types of vertices nen and women) nd very edge joins vertices of opposite types. aL % ff 8 38, Represent people in the group by vertices. Put a dinected ‘de ito the graph for every pi of vertices. Label he edge from the vertex representing A to the vertex representing B witha + pls) if likes Ba (minus) 4 ike B, ad 201f A is neural about 8B. Section 9.2 hy=6, = sea) = dete = eg) = 0, degle) = i pendant dso. aed. 3 =9: dal) = 2, dete dee) = 0, dea dea) = 4 death 2; dea()=3:dand fare isolated. No, because the sum ofthe degrees of the veties cant be add. 7. = se 75 deg-(a)=3, dog (O)= I, deg(e)=2, dep) eg" (a) = 1, a) = 2, deste) = 1 deed). vertices, 13 edges: dey (a) =6, deg*(a) =, deg-() 1, dep"(b) =, deg (e)=2, des*te)=5, deg) = 4, deg" (d) = 2, deg e) = 0, deg"(e) = 0 13, The numberof collaborators» has; someone who has reve collaborated: someone who has jst one collaborator 18.n the directed graph 6") = numberof calls v re ceived, deg"(P) = number of call» made i the uniected raph, dey) isthe numberof calls either made or resved by v.17. (deg(o), deg (0) isthe win-oss reo of ¥ 19. Construct the simple graph model in which V i he st of people inthe group and thee isan edge associated with [u,v] ifuaay know cach other Then the deprec of vertex» Isthenumbe of people v knows, By the esl of Exercise 18, ‘here re two vertices wth the same degree. Therefore thee Answers 0 Odd Numbered Exercises $55 are two people who know the same number of ther people inthe group 23.Notbiparite 25. Not biparie (Zamora, Agraharam, Smith, hou, Macinyre, planning, publicity, sales, marketing, devel ‘opment, industry relations} and = { (Zamora, planning), {Zamora sles}, (Zamora, marketing), (Zamoraindusry relation), (Agraharam, planing), (Agmiaram, devlop- ment), {Smuth, pubic), (Smith sales), (Smith industry resins), {Chou, planning), {Chou aes), {Chou indas- try relations), {Maciniyre, planing}, {Macinre, publi ity}, {Macinye, sales), (Maing, industry reais) Dy Many answers ae possible, such as Zamora-planning, ‘Agraaran- development, Smith-publiity, Chow-sales, and Macintyre indusy rations. 28a) verces, (a — 1/2 edges BW) vere, edges e)n-+ I vertices, 2 edges m+n vertices, mn eiges 2" vertices, 02" edges 3.33.3 b)22.22 943333 332.22 ©)3,3,3,3.3,3,3,3 38. Each ofthe vertcesin adjacent {0 each ofthe ober n ~ 1 vertes, so the degre sequence e na lonm tan Lnterms). 38.7 ar ayes )No, sum of degrees ised €)No_ )No, sum of de- res sod ayes 1) No, sum of degrees i od 39. First, suppose hat isdy--vdg is graphic, We must show tht the se- ‘quence whose terms are dy ~ 1, ds — 1-day hea ‘a. is eraphic ence i's put into noincreasing or: de In Exercise 38 is proved that if the original sequence 's graphic then in Tat thor is graph having this degree Sequence in which the vertex of degree dy is adjacent to the verioes of degrees do dh... dy. Remove fom this raph the vertex of highest degree (di). The resin erph has the desired degree sequence. Conversely, suppose that dis dyo-sdy is 2 norncreasing sequence such thatthe se agucnce da ~ by db ~ Boon dt ~ lta mood 8 traphic once its put ino noninresing ode. Take raph wit hs ater degree sequence, where vertex has degree 4—Vfor 21 2d) 41 and vertex vy as depres for +2 .<1

    You might also like