19 relations: Archimedean graph, Cube, Edge-transitive graph, Graph (discrete mathematics), Graph theory, Hamiltonian path, K-vertex-connected graph, Mathematics, Planar graph, Platonic solid, Polyhedral graph, Regular dodecahedron, Regular graph, Regular icosahedron, Regular map (graph theory), Tetrahedron, Turán graph, Vertex-transitive graph, Wheel graph.
Archimedean graph
In the mathematical field of graph theory, an Archimedean graph is a graph that forms the skeleton of one of the Archimedean solids.
New!!: Platonic graph and Archimedean graph · See more »
Cube
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex.
New!!: Platonic graph and Cube · See more »
Edge-transitive graph
In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps e1 to e2.
New!!: Platonic graph and Edge-transitive graph · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Platonic graph and Graph (discrete mathematics) · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Platonic graph and Graph theory · See more »
Hamiltonian path
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.
New!!: Platonic graph and Hamiltonian path · See more »
K-vertex-connected graph
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.
New!!: Platonic graph and K-vertex-connected graph · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Platonic graph and Mathematics · See more »
Planar graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints.
New!!: Platonic graph and Planar graph · See more »
Platonic solid
In three-dimensional space, a Platonic solid is a regular, convex polyhedron.
New!!: Platonic graph and Platonic solid · See more »
Polyhedral graph
In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron.
New!!: Platonic graph and Polyhedral graph · See more »
Regular dodecahedron
A regular dodecahedron or pentagonal dodecahedron is a dodecahedron that is regular, which is composed of twelve regular pentagonal faces, three meeting at each vertex.
New!!: Platonic graph and Regular dodecahedron · See more »
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
New!!: Platonic graph and Regular graph · See more »
Regular icosahedron
In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices.
New!!: Platonic graph and Regular icosahedron · See more »
Regular map (graph theory)
In mathematics, a regular map is a symmetric tessellation of a closed surface.
New!!: Platonic graph and Regular map (graph theory) · See more »
Tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners.
New!!: Platonic graph and Tetrahedron · See more »
Turán graph
No description.
New!!: Platonic graph and Turán graph · See more »
Vertex-transitive graph
In the mathematical field of graph theory, a vertex-transitive graph is a graph G such that, given any two vertices v1 and v2 of G, there is some automorphism such that In other words, a graph is vertex-transitive if its automorphism group acts transitively upon its vertices.
New!!: Platonic graph and Vertex-transitive graph · See more »
Wheel graph
In the mathematical discipline of graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle.
New!!: Platonic graph and Wheel graph · See more »