## Abstract A __rooted graph__ is a pair (__G,x__), where __G__ is a simple undirected graph and __x__ β __V__(__G__). If __G__ is rooted at __x__, its k__th rotation number h~k~__ (__G,x__) is the minimum number of edges in a graph __F__ of order |__G__| + __k__ such that for every __v__ β __V__(_
Rotation Numbers of Projectivities
β Scribed by M. Frantz; M. Misiurewicz
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 959 KB
- Volume
- 194
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Let __G__ be a simple undirected graph which has __p__ vertices and is rooted at __x__. Informally, the __rotation number h(G, x)__ of this rooted graph is the minimum number of edges in a __p__ vertex graph __H__ such that for each vertex __v__ of __H__, there exists a copy of __G__ in
## Abstract This study demonstrates a sampling scheme for threeβdimensional projection imaging with half the number of projections. The angular distribution of projections is designed so that the oversampling of the low spatial frequencies, in tandem with a partial Fourier algorithm, can be used to
## Abstract For a finite projective plane $\Pi$, let $\bar {\chi} (\Pi)$ denote the maximum number of classes in a partition of the point set, such that each line has at least two points in the same partition class. We prove that the best possible general estimate in terms of the order of projectiv