| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 393173 | Information Sciences | 2013 | 8 Pages |
Abstract
We introduce the concept of graphs with a path partition and define a special type of connectedness in these graphs. The connectedness is shown to have certain properties suitable for using graphs with a path partition as convenient background structures on digital spaces for the study of digital images. We introduce a family of such graphs on Z2Z2 and present a Jordan curve theorem for them.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Josef Šlapal,