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

Distance-regular graph and Hypercube graph

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

Difference between Distance-regular graph and Hypercube graph

Distance-regular graph vs. Hypercube 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. In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube.

Similarities between Distance-regular graph and Hypercube graph

Distance-regular graph and Hypercube graph have 3 things in common (in Unionpedia): Complete graph, Cubic graph, Regular graph.

Complete graph

No description.

Complete graph and Distance-regular graph · Complete graph and Hypercube graph · See more »

Cubic graph

In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three.

Cubic graph and Distance-regular graph · Cubic graph and Hypercube graph · 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.

Distance-regular graph and Regular graph · Hypercube graph and Regular graph · See more »

The list above answers the following questions

Distance-regular graph and Hypercube graph Comparison

Distance-regular graph has 35 relations, while Hypercube graph has 64. As they have in common 3, the Jaccard index is 3.03% = 3 / (35 + 64).

References

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

Hey! We are on Facebook now! »