𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of topologies on finite sets using graphs

✍ Scribed by N. P. Adamenko; I. G. Velichko

Book ID
106553903
Publisher
Springer
Year
2008
Tongue
English
Weight
95 KB
Volume
60
Category
Article
ISSN
0041-5995

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs and topologies on discrete sets
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

Topology of finite graphs
Topology of finite graphs
✍ John R. Stallings πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 English βš– 708 KB
On finite fixed sets in infinite graphs
On finite fixed sets in infinite graphs
✍ H.A. Jung πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 762 KB

## An automorphism of a graph X is called a translation of X if it fixes no finite non-empty set of vertices of X. It is shown that a group G of automorphisms of the connected graph X fixes a finite non-empty set of vertices or ends of X if and only if any two translations of X in G have a common