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.
Triangle-Free Graph
CHF 161.95
Auf Lager
SKU
NFIUC6JPIF5
1 Verfügbar 
Geliefert zwischen Do., 30.04.2026 und Fr., 01.05.2026
Details
High Quality Content by WIKIPEDIA articles! In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently defined as graphs with clique number 2, graphs with girth 4, graphs with no induced 3-cycle, or locally independent graphs. By Turán's theorem, the n-vertex triangle-free graph with the maximum number of edges is a complete bipartite graph in which the numbers of vertices on each side of the bipartition are as equal as possible. The triangle finding problem is the problem of determining whether a graph is triangle-free or not. When the graph does contain a triangle, algorithms are often required to output three vertices which form a triangle in the graph.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131139901
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131139901
- Format Fachbuch
- Titel Triangle-Free Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 104
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
