Izvorni znanstveni članak
https://doi.org/10.21857/y6zolb4zom
Computability of chainable graphs
Zvonko Iljazović
; Department of Mathematics, Faculty of Science, University of Zagreb, 10 000 Zagreb, Croatia
Matea Jelić
; Faculty of Civil Engineering, Architecture and Geodesy, University of Split, 21 000 Split, Croatia
Sažetak
If every semicomputable set, in arbitrary computable topological space, which is homeomorphic to a topological space A is computable, then we say that A has computable type. A topological pair (A, B), B ⊆ A, has computable type if for all semicomputable sets S and T, in arbitrary computable topological space, such that S is homeomorphic to A by a homeomorphism which maps T to B, it holds that S is computable. It is known that (G, E) has computable type, where G is a certain kind of topological graph and E is the set of its endpoints. In this paper, we consider more general graphs G~ obtained by taking edges of G~ to be chainable continua (instead of arcs) and we prove that (G~, E) has computable type, where E is the set of all endpoints of G~.
Ključne riječi
Computable topological space; semicomputable set; computable set; computable type; chainable continuum; chainable graph
Hrčak ID:
326509
URI
Datum izdavanja:
9.1.2025.
Posjeta: 0 *