Computability of Generalized Graphs
We investigate conditions under which a semicomputable set is computable. In particular, we study topological pairs <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo stretchy="false">(<...
Saved in:
| Main Authors: | Zvonko Iljazović, Matea Jelić |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/22/3468 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Topological Concepts Via Graph Theory
by: Taha H. Jasim, et al.
Published: (2020-08-01) -
ANALYSIS OF SELECTED TRANSPORTATION NETWORK STRUCTURES BASED ON GRAPH MEASURES
by: Renata ŻOCHOWSKA, et al.
Published: (2018-03-01) -
Bounds of the forgotten topological index and some Hamiltonian properties of graphs
by: Rao Li
Published: (2024-12-01) -
Fuzzy and crisp computational analysis of certain graphs structures via machine learning techniques
by: Zeeshan Saleem Mufti, et al.
Published: (2025-02-01) -
Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs
by: Shen Lu, et al.
Published: (2022-04-01)