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

Distance-transitive graph and Tetrahedron

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

Difference between Distance-transitive graph and Tetrahedron

Distance-transitive graph vs. Tetrahedron

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

Similarities between Distance-transitive graph and Tetrahedron

Distance-transitive graph and Tetrahedron have 6 things in common (in Unionpedia): Complete graph, Cube, Distance-regular graph, Dodecahedron, Graph (discrete mathematics), Graph theory.

Complete graph

No description.

Complete graph and Distance-transitive graph · Complete graph and Tetrahedron · 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.

Cube and Distance-transitive graph · Cube and Tetrahedron · 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 Tetrahedron · 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 Tetrahedron · 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 Tetrahedron · See more »

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.

Distance-transitive graph and Graph theory · Graph theory and Tetrahedron · See more »

The list above answers the following questions

Distance-transitive graph and Tetrahedron Comparison

Distance-transitive graph has 34 relations, while Tetrahedron has 202. As they have in common 6, the Jaccard index is 2.54% = 6 / (34 + 202).

References

This article shows the relationship between Distance-transitive graph and Tetrahedron. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »