Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
K-Vertex-Connected Graph
CHF 37.00
Auf Lager
SKU
H7AD6PEF08U
1 Verfügbar 
Geliefert zwischen Do., 29.01.2026 und Fr., 30.01.2026
Details
High Quality Content by WIKIPEDIA articles! In graph theory, a graph G with vertex set V(G) is said to be k-vertex-connected (or k-connected) for k V(G) if G X is connected for all X V(G) with X k. In plain English, a graph is k-connected if the graph remains connected when you delete fewer than k vertices from the graph. In accordance with the definition, the complete graph Kn is (n 1)-connected for n 2. As a special case that does not match the definition, K1 is regarded as 1-connected. An equivalent definition for graphs with two or more vertices is that a graph is k-connected if any two of its vertices can be joined by k independent paths; see Menger's theorem (Diestel 2005, p. 55). A 1-vertex-connected graph is called connected, while a 2-vertex-connected graph is said to be biconnected. The vertex-connectivity, or just connectivity, of a graph is the largest k for which the graph is k-vertex-connected.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131135804
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131135804
- Format Fachbuch
- Titel K-Vertex-Connected Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 64
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
