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.
Simplex Graph
CHF 43.20
Auf Lager
SKU
B1FEB3SPTSG
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
High Quality Content by WIKIPEDIA articles! In graph theory, a branch of mathematics, the simplex graph (G) of an undirected graph G is itself a graph, with one node for each clique (a set of mutually adjacent vertices) in G. Two nodes of (G) are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex. The empty set is included as one of the cliques of G that are used to form the clique graph, as is every set of one vertex and every set of two adjacent vertices. Therefore, the simplex graph contains within it a subdivision of G itself. The simplex graph of a complete graph is a hypercube graph, and the simplex graph of a cycle graph of length four or more is a gear graph. The simplex graph of the complement graph of a path graph is a Fibonacci cube.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131161506
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131161506
- Format Fachbuch
- Titel Simplex Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 76
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
