olemus
(2a) graafiteoorias:
graaf on sidus, kui
iga kaht tippu ühendab kaartest koosnev ahel
= in a graph, a measure of concatenated adjacency (the number of ways that points are connected to each other)
https://en.wikipedia.org/wiki/Connectivity_(graph_theory)
https://www.csd.uoc.gr/~hy583/papers/ch17.pdf

(2b) topoloogias:
topoloogiline ruum T on sidus, kui
T olles kahe lõikumatu lahtise hulga A ja B ühend,
on A või B tühi hulk
= the property of a topological space stating that it is impossible to represent the space as the sum of two non-empty disjoint subsets
https://encyclopediaofmath.org/wiki/Connectivity
https://en.wikipedia.org/wiki/Connected_space

vt ka
- sidusus (2)
- sidususpunkt