𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Class of Spaces Containing all Connected and all Locally Connected Spaces

✍ Scribed by J. K. Kohli


Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
507 KB
Volume
82
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


A simultaneous generalization of connectedness and local connectedness, called sum connectedness, is introduced. The category of sum cohnected spaces forms the smallest co-reflective subcategory of TOP contaihing all connected spaces. A product theorem, analogous t o that for locally connected spaces, is proved for sum connected spaces and a necessary and sufficient condition for the STONE-CECH compactificetion of a TYCHONOFF space t o be sum connected is obtained. 1) See FRANKLIN [7] for the definition.


πŸ“œ SIMILAR VOLUMES


Almost All 3-Connected Graphs Contain a
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 223 KB

McCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a connected subgraph H on k vertices such that G&V(H) is 2-connected. We prove the weaker statement that every sufficiently large 3-connected graph G contains a not necessarily connected subgraph H on k vertices s

Connected cutsets of a graph and triangl
✍ P Duchet; M Las Vergnas; H Meyniel πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 602 KB

We investigate some properties of graphs whose cycle space has a basis constituted of triangles ('null-homotopic' graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto Ks. These characterizations involve separating subsets and decompos

FDTD and TLM analysis of a PIFA using an
✍ Hui Geng; M. Hira; T. Shiozawa πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract This letter presents an optimization procedure for the synthesis of a planar inverted‐F antenna (PIFA). The procedure uses the combing method to exploit the advantages of the FDTD and TLM algorithms. A proposed connection interface between the FDTD and TLM with irregularly graded space