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.
Chordal Graph
CHF 36.90
Auf Lager
SKU
5B0S4U380P8
1 Verfügbar 
Geliefert zwischen Do., 05.02.2026 und Fr., 06.02.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the mathematical area of graph theory, a graph is chordal if each of its cycles of four or more nodes has a chord, which is an edge joining two nodes that are not adjacent in the cycle. An equivalent definition is that any chordless cycles have at most three nodes. Chordal graphs are a subset of the perfect graphs. They are sometimes also called triangulated graphs. A perfect elimination ordering in a graph is an ordering of the vertices of the graph such that, for each vertex v, v and the neighbors of v that occur later than v in the order form a clique. A graph is chordal if and only if it has a perfect elimination ordering (Fulkerson & Gross 1965).
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130421892
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Größe H4mm x B220mm x T150mm
- EAN 9786130421892
- Format Fachbuch
- Titel Chordal Graph
- Gewicht 114g
- Herausgeber Betascript Publishing
- Anzahl Seiten 64
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
