## Abstract In 1966, Chartrand proved that if the minimum degree of a graph is at least the floor of half the number of nodes, then its edge‐connectivity equals its minimum degree. A more discriminating notion of edge‐connectivity is introduced, called the __k__‐component order edge‐connectivity, w
Generalized edge theorem
✍ Scribed by Y.C. Soh; Y.K. Foo
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 329 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abztract- The generalized Green's theorem introduced in [l] for smooth domains is here extended to Lipschitz domahrs (hence, including the case of polyhedrons, which is particularly important in numerical analysis). For first-order linear differential systems whose coefficient matrices are Lipc
This article is a theoretical investigation of generalized Noether's theorem, which, though unconcerned with considerations such as coordinate transformations, symmetry, and invariance, is the basic mechanism of conventional Noether's theorem, its extensions, and its inverse. The generalized theorem