20.500.12556/DKUM-20025 PERMUTAEDER PERMUTOHEDRON V diplomskem delu bomo podrobneje obravnavali konveksni politop imenovan permutaeder. V prvem poglavju bomo spoznali matematične definicije nekaterih pojmov, ki jih bomo potrebovali v nadaljevanju. V drugem poglavju si bomo pogledali dokaz, da je graf permutaedra hamiltonski graf. V tretjem poglavju bomo dokazali, da razdalje med oglišči v n-dimenzionalnem permutaedru zavzemajo vsa soda števila. V četrtem poglavju si bomo pogledali asociaeder, ki posplošuje permutaeder. In the thesis we discuss in more detail the convex polytope called permutohedron. In the first chapter we present mathematical definitions of certain concepts which we need later on. In the second chapter we show that the graph of permutohedron is a Hamiltonian graph. In the third chapter we prove that the distances between the vertices in n-dimensional permutohedron take all even numbers. In the fourth chapter we look at another polytope associahedron, which generalizes permutohedron. permutaeder zonotop konveksni politop hamiltonski graf minkowskyjeva vsota Caylejev graf asociaeder. permutohedron zonohedron convex polytopes Hamiltonian graphs Minkowski sum Cayley graph associahedron. true true false [K. Prah] Slovenski jezik Angleški jezik Diplomsko delo 2011-09-06 19:56:43 2011-09-26 14:35:03 2022-04-13 15:50:20 2023-12-25 03:25:13 2011 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 51(043.2) 18640904 URN:SI:UM:DK:TWJWL7WT UNI_Prah_Klara_2011.pdf UNI_Prah_Klara_2011.pdf 1 5A3E4F07452F4127F67C9B0AA8E6BAE7 176dc29c42f0e07b5c123b469f81caf059c4a8e93f0585dc5da6f29cf6d5eb69 84d54d4b-7c05-11eb-bb7a-00155d0001ca 20.500.12556/dkum/0a547c3a-3a3c-440e-aed1-fdbb60c4621d https://dk.um.si/Dokument.php?lang=slv&id=24551 Fakulteta za naravoslovje in matematiko 0 0 0