• Thumbnail for Platonic graph
    mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them...
    2 KB (126 words) - 23:01, 21 April 2024
  • Thumbnail for Regular icosahedron
    edges, and 12 vertices. It is an example of the Platonic solid and of the deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron...
    35 KB (3,685 words) - 03:37, 19 April 2024
  • a symmetric graph. Similarly to the Platonic graphs, the cycle graphs form the skeletons of the dihedra. Their duals are the dipole graphs, which form...
    5 KB (507 words) - 13:18, 19 September 2022
  • Thumbnail for Cube
    Cube (redirect from Cubical graph)
    forms a graph with 8 vertices and 12 edges, called the cube graph. It is a special case of the hypercube graph. It is one of 5 Platonic graphs, each a...
    19 KB (1,778 words) - 12:57, 17 May 2024
  • Thumbnail for Hamiltonian path
    of Hamiltonian paths (Rédei 1934) Every platonic solid, considered as a graph, is Hamiltonian The Cayley graph of a finite Coxeter group is Hamiltonian...
    18 KB (2,012 words) - 06:17, 3 May 2024
  • Thumbnail for Regular dodecahedron
    a graph. It is one of 5 Platonic graphs, each a skeleton of its Platonic solid. This graph can also be constructed as the generalized Petersen graph G(10...
    34 KB (3,378 words) - 05:19, 29 March 2024
  • Thumbnail for Eulerian path
    Eulerian path (redirect from Eulerian graph)
    In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...
    27 KB (3,269 words) - 06:54, 4 May 2024
  • Dodecahedron (category Platonic solids)
    is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. There are also three regular star dodecahedra, which are constructed...
    28 KB (2,027 words) - 01:06, 24 April 2024
  • graphs (such as the Petersen graph, the Heawood graph and the vertices and edges of the Platonic solids). The finite Cayley graphs (such as cube-connected...
    6 KB (636 words) - 22:09, 26 January 2024
  • Thumbnail for Regular map (graph theory)
    lines. Topological graph theory Abstract polytope Planar graph Toroidal graph Graph embedding Regular tiling Platonic solid Platonic graph Nedela (2007) Coxeter...
    16 KB (1,090 words) - 16:04, 14 May 2024
  • Thumbnail for Dual graph
    duality to be recognized was the association of the Platonic solids into pairs of dual polyhedra. Graph duality is a topological generalization of the geometric...
    51 KB (6,580 words) - 02:26, 3 January 2024
  • Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton...
    14 KB (1,251 words) - 14:50, 13 March 2024
  • Archimedean graphs. Platonic graph Wheel graph An Atlas of Graphs, p. 267-270 An Atlas of Graphs, p. 261 Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford...
    4 KB (120 words) - 23:02, 21 April 2024
  • Thumbnail for Dipole graph
    covering graph of D4. Similarly to the Platonic graphs, the dipole graphs form the skeletons of the hosohedra. Their duals, the cycle graphs, form the...
    2 KB (172 words) - 12:43, 19 March 2024
  • Thumbnail for Tetrahedron
    forms a graph, with 4 vertices, and 6 edges. It is a special case of the complete graph, K4, and wheel graph, W4. It is one of 5 Platonic graphs, each a...
    72 KB (8,662 words) - 19:27, 3 June 2024
  • Thumbnail for 5
    the largest face that any of the five regular three-dimensional regular Platonic solid can have, as represented in the regular dodecahedron. For curves...
    102 KB (13,031 words) - 22:00, 4 June 2024
  • Thumbnail for Truncated icosidodecahedron
    hexagons, and 12 regular decagons. It has the most edges and vertices of all Platonic and Archimedean solids, though the snub dodecahedron has more faces. Of...
    14 KB (850 words) - 18:49, 29 July 2023
  • In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than...
    21 KB (2,519 words) - 12:59, 2 December 2023
  • Thumbnail for Polyhedron
    constructed from the Platonic solids by a process called stellation. Most stellations are not regular. The study of stellations of the Platonic solids was given...
    87 KB (9,850 words) - 21:04, 25 May 2024
  • Euler characteristic (category Topological graph theory)
    theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco...
    29 KB (3,445 words) - 21:27, 7 March 2024
  • Thumbnail for Octahedron
    Octahedron (category Platonic solids)
    The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each...
    26 KB (2,764 words) - 20:47, 29 May 2024
  • Thumbnail for Rhombicuboctahedron
    rhombicuboctahedral graph is the graph of vertices and edges of the rhombicuboctahedron. It has 24 vertices and 48 edges, and is a quartic Archimedean graph. Compound...
    19 KB (1,660 words) - 17:41, 21 March 2024
  • interpretation of quantum mechanics and the philosophical debate between Platonic realism and nominalism. Anathem is set on the fictional planet of Arbre...
    23 KB (3,018 words) - 23:22, 31 May 2024
  • Thumbnail for Archimedean solid
    symmetric vertices, which is divided into the Archimedean solids, the five Platonic solids (each with only one type of polygon face), and the two infinite...
    26 KB (1,309 words) - 05:59, 3 November 2023
  • Thumbnail for Euclidean plane
    Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to...
    16 KB (1,963 words) - 04:54, 30 April 2024
  • S2CID 85618870. Lanphier, D.; Rosenhouse, J. (2004). "Cheeger constants of Platonic graphs". Discrete Mathematics. 277 (1–3): 101–113. doi:10.1016/S0012-365X(03)00178-X...
    8 KB (695 words) - 11:40, 8 April 2024
  • Thumbnail for ADE classification
    McKay. The connection to Platonic solids is described in (Dickson 1959). The correspondence uses the construction of McKay graph. Note that the ADE correspondence...
    21 KB (2,628 words) - 03:28, 9 April 2024
  • Thumbnail for Convex polytope
    isomorphic if their face lattices are isomorphic. The polytope graph (polytopal graph, graph of the polytope, 1-skeleton) is the set of vertices and edges...
    23 KB (3,266 words) - 17:46, 21 May 2024
  • study of the attraction between people which leads to the development of platonic or romantic relationships. It is distinct from perceptions such as physical...
    64 KB (7,220 words) - 16:37, 24 May 2024
  • Thumbnail for Kepler–Poinsot polyhedron
    this, they are not necessarily topologically equivalent to the sphere as Platonic solids are, and in particular the Euler relation χ = V − E + F = 2   {\displaystyle...
    31 KB (2,312 words) - 05:44, 24 May 2024