Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Distance-transitive graph and Regular icosahedron

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Distance-transitive graph and Regular icosahedron

Distance-transitive graph vs. Regular icosahedron

In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices.

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 · See more »

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 · See more »

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 · 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".

Distance-transitive graph and Graph (discrete mathematics) · Graph (discrete mathematics) and Regular icosahedron · See more »

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 · See more »

The list above answers the following questions

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:

Hey! We are on Facebook now! »