Search Results for ""
771 - 780 of 1053 for Regular homotopySearch Results
View search results from all Wolfram sites (4895 matches)How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...
The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...
257 is a Fermat prime, and the 257-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. An illustration of the 257-gon is not included ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...
A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...
Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...
The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...
The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...
The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
...