Categorical aspects of inducing closure operators on graphs by sets of walks

DOI10.1016/j.jcss.2017.02.005zbMath1391.68116OpenAlexW2594491814MaRDI QIDQ1747500

Josef Šlapal

Publication date: 8 May 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.02.005

zbMATH Keywords

closure operatorsimple graphwalkdigital topologydiagonal walk setGalois correspondence between concrete categories

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Topological spaces and generalizations (closure spaces, etc.) (54A05) Special categories (18B99) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Computer graphics and connected topologies on finite ordered sets
• Graphs with a path partition for structuring digital spaces
• A theory of binary digital pictures
• Convenient Closure Operators on $\mathbb Z^2$
• Digital Topology
• A Topological Approach to Digital Topology
• Path-set induced closure operators on graphs
• On topological spaces associated with digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Categorical aspects of inducing closure operators on graphs by sets of walks