Ring and Module Structures on Zn-Labeled Trees

von Gavirangaiah K

Softcover - 9786204738383

43,90 €

Versandkostenfrei

Auf meine Merkliste

Hinweis: Print on Demand. Lieferbar in 5 Tagen.

Lieferzeit nach Versand: ca. 1-2 Tage
inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Autorenfreundlich Bücher kaufen?!

Beschreibung

A 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.