A note on control polygons and derivatives
β Scribed by Louis J. Nachman
- Book ID
- 103595876
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 191 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8396
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Earlier work has dealt with controls which guarantee that every trajectory of a given dynamical system remains outside (avoids) a prescribed set (anti-target) for all time. In the present treatment, we permit the intersection of the anti-target but consider two cases of avoidance: the anti-target mu
A near-polygonal graph is a graph which has a set C of m-cycles for some positive integer m such that each 2-path of is contained in exactly one cycle in C. If m is the girth of then the graph is called polygonal. Given a polygonal graph of valency r and girth m, Archdeacon and Perkel proved the exi