{"product_id":"ring-and-module-structures-on-zn-labeled-trees-von-gavirangaiah-k","title":"Ring and Module Structures on Zn-Labeled Trees","description":"\u003cp\u003eA graph is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is called a Hamiltonian cycle of G, and G is said to be a Hamiltonian graph. A Hamiltonian path is a path that contains all the vertices in V (G) but does not return to the vertex in which it began. The connectivity ¿ = ¿(G) of a graph G is the minimum number of vertices whose removal results in a disconnected graph. For ¿ ¿ k, we say that G is k-connected. For ¿ = k, we say that G is strictly k-connected.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9786204738383\"\u003e\u003ch3\u003eRing and Module Structures\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9786204738383","offer_id":39819717476445,"sku":"9786204738383","price":43.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/5f82f145-78b9-4823-902d-e8c862523dd2.jpg?v=1758347757","url":"https:\/\/shop.autorenwelt.de\/en\/products\/ring-and-module-structures-on-zn-labeled-trees-von-gavirangaiah-k","provider":"Autorenwelt Shop","version":"1.0","type":"link"}