Toroidal Graph
Versandkostenfrei!
Versandfertig in 6-10 Tagen
23,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 Blanu a snarks, (Orbani et al. 2004) and all Möbius ladders are toroid...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 Blanu a 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 (Maru i & Pisanski 2000).
Andere Kunden interessierten sich für
