Search Results for ""
1081 - 1090 of 2823 for Unit distance graphSearch Results
Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...
As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...
An Archimedean circle is a circle defined in the arbelos in a natural way and congruent to Archimedes' circles, i.e., having radius rho=1/2r(1-r) for an arbelos with outer ...
Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...
Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...
Consider the average volume of a tetrahedron picked at random inside an octahedron of unit volume. The answer is difficult to compute analytically (Zinani 2003), but the mean ...
The curlicue fractal is a figure obtained by the following procedure. Let s be an irrational number. Begin with a line segment of unit length, which makes an angle phi_0=0 to ...
The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...
There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...
A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...
...
View search results from all Wolfram sites (22301 matches)

