An upper and a lower bound for the distance of a manifold to a nearby point
β Scribed by M.H.C. Paardekooper
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 361 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d
## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edgeβdisjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ β€ 1/2 __u__ + __g__ β 1 β€ __n__ β 1, where __n__ is the total numbe
Hill's extremum principles are not directly applicable to an Ellis model fluid. A method of adapting Hill's principles to the Ellis model was developed and used to calculate upper and lower bounds on the drag coefficient for a sphere moving slowly through such a fluid. Amilable experimental data wer