Question

4.1.8. Determine (G), K'(G), and 8(G) for each graph G below. (Hint: For the graph the left, on Proposition 4.1.12 to establish the edge-connectivity.) use

Answer 1

Anuoens C4-1.8) From the en onation NoW TD delumine kca), kcaj and dah caed raph G deaon helow. On the hoft be a and nght be ny ppantn I s'H a t of verficy aguaph Cc 7 veS 0y defintson of cauilay ult: HaIa imple graph and Some nonempty ppes Aulret Sof vca), thn Faom th fgue ghen, can Jun that all the veutse har a deguu of fou ofther than

that n the Cintu whch have h degues Seven In the uaph Gthe tso veiticu faom ct whrck doy not have 9n Cohrch th 910ph enarahng giMns Kia) 2 dehnito on hen pesent in the edye cat a minimum vetrar of fre m a cut-vealen Apply Png the eult grn n th lene than AouL edgy au Tt wo1ha eredy sode In the pauposotion fun that ammimum there On One nde thu di1 Mated afowe, can nunder Of reticou of Juven f £1 MA90und Cafsl)0and th ulsropl f omshoutd krwhrch n nt theu in 6, FOR the goph H 4thoring that R puuating having ernt the Nepelt can un d. can that kCHCHkSCH)Y Th Considesns hooeitres that each othee tn H- and shaong that n ivuy dpueton auound th cente tor %,y path 2,y paths Intenally and to moe all Auek pathi veutey au th unoved thet tke aetult poved a et asne of thee does nof be gtven Can be pore d y Cu au thee cshrd do not shau vateu