Separation relations and quasi-proximities
✍ Scribed by Don A. Mattson
- Publisher
- Springer
- Year
- 1967
- Tongue
- English
- Weight
- 418 KB
- Volume
- 171
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We investigate separation properties for neighbourhood spaces in some details within a framework of constructive mathematics, and define corresponding separation properties for quasi‐apartness spaces. We also deal with separation properties for spaces with inequality. (© 2008 WILEY‐VCH
The transmission of a vertex in a connected graph is the sum of all distances from that vertex to the others. It is said to be normalized if divided by n -1, where n denotes the order of the graph. The proximity of a graph is the minimum normalized transmission, while the remoteness is the maximum n
We introduce polyhedral cones and polytopes, associated with quasi-semi-metrics (oriented distances), in particular with oriented multi-cuts, on n points. We compute generators and facets of these polyhedra for small values of n and study their graphs.