๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Supercomputers and Discrete Topology

โœ Scribed by Ryabov, G. G.; Surguladze, M. Sh.


Book ID
125364604
Publisher
Springer US
Year
2014
Tongue
English
Weight
101 KB
Volume
197
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Discrete topological spaces
โœ D. V. Chudnovskii ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Springer ๐ŸŒ English โš– 202 KB
Graphs and topologies on discrete sets
โœ Pascal Prรฉa ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 597 KB

PrCa, P., Graphs and topologies on discrete sets, Discrete Mathematics 103 (1992) 189-197. We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for

Supercomputers
โœ Schneck, P B ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Annual Reviews โš– 666 KB