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

Graph automorphism and Regular icosahedron

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

Difference between Graph automorphism and Regular icosahedron

Graph automorphism vs. Regular icosahedron

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. In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices.

Similarities between Graph automorphism and Regular icosahedron

Graph automorphism and Regular icosahedron have 5 things in common (in Unionpedia): Distance-regular graph, Distance-transitive graph, Graph (discrete mathematics), Regular graph, Symmetric graph.

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 Graph automorphism · Distance-regular graph and Regular icosahedron · See more »

Distance-transitive graph

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.

Distance-transitive graph and Graph automorphism · Distance-transitive graph 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".

Graph (discrete mathematics) and Graph automorphism · Graph (discrete mathematics) and Regular icosahedron · 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.

Graph automorphism and Regular graph · Regular graph and Regular icosahedron · See more »

Symmetric graph

In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of G, there is an automorphism such that In other words, a graph is symmetric if its automorphism group acts transitively upon ordered pairs of adjacent vertices (that is, upon edges considered as having a direction).

Graph automorphism and Symmetric graph · Regular icosahedron and Symmetric graph · See more »

The list above answers the following questions

Graph automorphism and Regular icosahedron Comparison

Graph automorphism has 43 relations, while Regular icosahedron has 163. As they have in common 5, the Jaccard index is 2.43% = 5 / (43 + 163).

References

This article shows the relationship between Graph automorphism and Regular icosahedron. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »