Sisi (geometri): Perbedaan antara revisi
Konten dihapus Konten ditambahkan
k Bot: Perubahan kosmetika |
k replaced: konkrit → konkret |
||
Baris 10:
== Relasi dengan sisi-sisi dalam grafik ==
Dalam [[teori graf]], suatu [[:en:Edge (graph theory)|sisi]] adalah sebuah objek abstrak yang menghubungkan dua [[:en:vertex (graph theory)|verteks graf]], bukan seperti sisi-sisi poligon atau polihedron yang mempunyai representasi geometri
However, any polyhedron can be represented by its [[n-skeleton|skeleton]] or edge-skeleton, a graph whose vertices are the geometric vertices of the polyhedron and whose edges correspond to the geometric edges.<ref>{{citation|title=Shaping Space: Exploring Polyhedra in Nature, Art, and the Geometrical Imagination|first=Marjorie|last=Senechal|authorlink=Marjorie Senechal|publisher=Springer|year=2013|isbn=9780387927145|page=81|url=http://books.google.com/books?id=kZtCAAAAQBAJ&pg=PA81}}.</ref> Conversely, the graphs that are skeletons of three-dimensional polyhedra can be characterized by [[Steinitz's theorem]] as being exactly the [[k-vertex-connected graph|3-vertex-connected]] [[planar graph]]s.<ref>{{citation
| last1 = Pisanski | first1 = Tomaž | author1-link = Tomaž Pisanski
| |||