Path-set induced closure operators on graphs
Keyword(s):
Given a simple graph, we associate with every set of paths of the same positive length a closure operator on the (vertex set of the) graph. These closure operators are then studied. In particular, it is shown that the connectedness with respect to them is a certain kind of path connectedness. Closure operators associated with sets of paths in some graphs with the vertex set Z2 are discussed which include the well known Marcus-Wyse and Khalimsky topologies used in digital topology. This demonstrates possible applications of the closure operators investigated in digital image analysis.
Keyword(s):
2000 ◽
Vol 10
(2)
◽
pp. 7-9
2019 ◽
Vol 8
(3)
◽
pp. 11
◽
Keyword(s):
2008 ◽
Vol 14
(2)
◽
pp. 192-200
◽
Keyword(s):
Keyword(s):