Digital topology
Builds on GraphConnected component
Definition
Let and be distinct points of .
- and are -adjacent if .
- and are -adjacent if .
- For , a -path in a set is a finite sequence of points of in which consecutive points are -adjacent.
- is -connected if any two points of are joined by a -path in ; the maximal -connected subsets of are its -components.
Digital topology is the study of such adjacency, connectedness and separation notions on and their analogues on . For each , the -adjacency makes a graph whose connected components are the -components of .
Remarks
Example: is -connected, since the two points are -adjacent. Non-example: the same is not -connected, because and has no other points. Let . With -adjacency for , the point is -adjacent to , so the complement is -connected and the "curve" encloses nothing. With -adjacency for the complement, is a -component by itself, so separates it from the outside. For this reason one pairs -adjacency for a set with -adjacency for its complement, or the reverse. The Khalimsky topology on is a genuine topology: the sets and for form a base, and is connected in it.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Graph concept
- Graph definition
- Walk definition
- Reachability definition
- Connected component definition
- Digital topology definition
Further reading
About this page
| Tag | GH2SFDQNAE |
|---|---|
| URI | m2://GH2SFDQNAE |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68U03, 68U10 |
| Defines | Digital topology |
| Uses | Graph, Connected component |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.