|
|
|
Toroidal Graph: Mathematics, Graph (Mathematics), Embedding, Torus, Heawood Graph, Complete Graph
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Lieferstatus: |
 i.d.R. innert 7-14 Tagen versandfertig |
| Veröffentlichung: |
März 2026
|
| Genre: |
Schulbücher |
| ISBN: |
9786131238239 |
|
EAN-Code:
|
9786131238239 |
| Verlag: |
Omniscriptum |
| Einband: |
Kartoniert |
| Sprache: |
English
|
| Dimensionen: |
H 220 mm / B 150 mm / D 6 mm |
| Gewicht: |
149 gr |
| Seiten: |
88 |
| Bewertung: |
Titel bewerten / Meinung schreiben
|
| Inhalt: |
| High Quality Content by WIKIPEDIA articles! In mathematics, a graph G is
toroidal if it can be embedded on the torus. In other words, the graph's
vertices can be placed on a torus such that no edges cross. Usually, it
is assumed that G is also non-planar.The Heawood graph, the complete
graph K7 (and hence K5 and K6), the Petersen graph (and hence the
complete bipartite graph K3,3, since the Petersen graph contains a
subdivision of it), the Blanusa snarks, (Orbani¿ et al. 2004) and all
Möbius ladders are toroidal. More generally, any graph with crossing
number 1 is toroidal. Some graphs with greater crossing numbers are also
toroidal: the Möbius-Kantor graph, for example, has crossing number 4
and is toroidal (Marusi¿ & Pisanski 2000). |
|
Newsfeed | 
Facebook | 
Twitter
