Add to ORKGThe main goal of this work is to present a topology, called a graph topology, on finite digital images. We deal with some properties of this topology such as k-connectivity and digital continuous mapping. We finally show that the property of being graph topology is a topological invariant between digital isomorphic finite digital images
AbstractIn usual topology, a homeomorphism is a one to one mapping between two topological spaces wh...
Digital topology necessarily tries to get good finite representations of infinite spaces. Then it an...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
WOS: 000450137200015The main goal of this work is to present a topology, called a graph topology, on...
The aim of this paper is to give an introduction into the field of digital topology. This topic of r...
AbstractIn usual topology, a homeomorphism is a one to one mapping between two topological spaces wh...
AbstractThis paper contains a brief outline—in a form intended to clarify their interrelation—of fou...
AbstractMotivated by a problem in computer graphics, we develop a finite analog of the Jordan curve ...
AbstractIn an earlier paper written for a different readership [Computers and Graphics 13(2) (1989) ...
Digital topological methods are often used on computing the topological complexity of digital images...
In this paper, we recall some definitions and properties from digital topology and soft set theory. ...
In this paper we prove results relating to two homotopy relations and four homology theories develop...
Abstract. The paper presents an introduction to computer topology with applications to image process...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractA fenestration of the topological space S is a collection of disjoint open sets whose union ...
AbstractIn usual topology, a homeomorphism is a one to one mapping between two topological spaces wh...
Digital topology necessarily tries to get good finite representations of infinite spaces. Then it an...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
WOS: 000450137200015The main goal of this work is to present a topology, called a graph topology, on...
The aim of this paper is to give an introduction into the field of digital topology. This topic of r...
AbstractIn usual topology, a homeomorphism is a one to one mapping between two topological spaces wh...
AbstractThis paper contains a brief outline—in a form intended to clarify their interrelation—of fou...
AbstractMotivated by a problem in computer graphics, we develop a finite analog of the Jordan curve ...
AbstractIn an earlier paper written for a different readership [Computers and Graphics 13(2) (1989) ...
Digital topological methods are often used on computing the topological complexity of digital images...
In this paper, we recall some definitions and properties from digital topology and soft set theory. ...
In this paper we prove results relating to two homotopy relations and four homology theories develop...
Abstract. The paper presents an introduction to computer topology with applications to image process...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractA fenestration of the topological space S is a collection of disjoint open sets whose union ...
AbstractIn usual topology, a homeomorphism is a one to one mapping between two topological spaces wh...
Digital topology necessarily tries to get good finite representations of infinite spaces. Then it an...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...