Ring and Module Structures on Zn-Labeled Trees - K., Gavirangaiah
29,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
15 °P sammeln
  • Broschiertes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
Dr. GAVIRANGAIAH K is currently working as an Assistant Professor in the department of Mathematics, Government First grade college, Tumkur, Karnataka. He has been teaching Mathematics for more than 12 years. His research interest is in Graph theory. He published more than 6 papers in peer reviewed international journals.