Similarities between Distance-transitive graph and Regular icosahedron
Distance-transitive graph and Regular icosahedron have 5 things in common (in Unionpedia): Distance (graph theory), Distance-regular graph, Dodecahedron, Graph (discrete mathematics), Graph automorphism.
Distance (graph theory)
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them.
Distance (graph theory) and Distance-transitive graph · Distance (graph theory) and Regular icosahedron ·
Distance-regular graph
In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k, and i.
Distance-regular graph and Distance-transitive graph · Distance-regular graph and Regular icosahedron ·
Dodecahedron
In geometry, a dodecahedron (Greek δωδεκάεδρον, from δώδεκα dōdeka "twelve" + ἕδρα hédra "base", "seat" or "face") is any polyhedron with twelve flat faces.
Distance-transitive graph and Dodecahedron · Dodecahedron and Regular icosahedron ·
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".
Distance-transitive graph and Graph (discrete mathematics) · Graph (discrete mathematics) and Regular icosahedron ·
Graph automorphism
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.
Distance-transitive graph and Graph automorphism · Graph automorphism and Regular icosahedron ·
The list above answers the following questions
- What Distance-transitive graph and Regular icosahedron have in common
- What are the similarities between Distance-transitive graph and Regular icosahedron
Distance-transitive graph and Regular icosahedron Comparison
Distance-transitive graph has 34 relations, while Regular icosahedron has 163. As they have in common 5, the Jaccard index is 2.54% = 5 / (34 + 163).
References
This article shows the relationship between Distance-transitive graph and Regular icosahedron. To access each article from which the information was extracted, please visit: