Let n >k> 1 with n even and k odd. Make a k-regular graph G by putting n vertices in a circle and...
need help with a and b in this graph theory question
Let n >k> 1 with n even and k odd. Make a k-regular graph G by putting n vertices in a circle and connecting each vertex to the exact a) Show that for all u,v there are k internally disjoint u, v-paths (you (b) Use the previous part, even if you did not prove it, to show that the e vertex and the k 1 closest vertices on either side must do this for all possible k and n.) connectivity of G is k(G) k. Hint: Use a theorem
Let n >k> 1 with n even and k odd. Make a k-regular graph G by putting n vertices in a circle and connecting each vertex to the exact a) Show that for all u,v there are k internally disjoint u, v-paths (you (b) Use the previous part, even if you did not prove it, to show that the e vertex and the k 1 closest vertices on either side must do this for all possible k and n.) connectivity of G is k(G) k. Hint: Use a theorem
on, Let hzK?l win n even and k odd make q oph nby puty b vertices in a arcule and unned egular Cach verty to the exaut opporite vertex and k vertices on eina 시'de La) Show that for all uv there are k internally dus joint this fox all posi ble K and n) し,V-Pahn (Jou (must do th A for au f and ondy is is Centans Soluhom k Commeuted Coine internally vextex dioint path belwces two vertCe any But iㅅ there and divelt way to provett -has exatutk internaly dnyǐnt u, v-Paths