Closure operators on graphs for modeling connectedness in digital spaces

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F18%3APU131387" target="_blank" >RIV/00216305:26230/18:PU131387 - isvavai.cz</a>

Výsledek na webu

<a href="http://journal.pmf.ni.ac.rs/filomat/index.php/filomat/article/view/7904" target="_blank" >http://journal.pmf.ni.ac.rs/filomat/index.php/filomat/article/view/7904</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.2298/FIL1814011S" target="_blank" >10.2298/FIL1814011S</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Closure operators on graphs for modeling connectedness in digital spaces

Popis výsledku v původním jazyce

For undirected simple graphs, we introduce closure operators on their vertex sets induced by sets of walks of the same lengths. Some basic properties of these closure operators are studied, with greater attention paid to connectedness. We focus on the closure operators induced by certain sets of walks in the 2-adjacency graph on the digital line Z, which generalize the Khalimsky topology. For the closure operators on Z^2 obtained as particularly defined products of pairs of the induced closure operators on Z, we formulate and prove a digital form of the Jordan curve theorem.

Název v anglickém jazyce

Closure operators on graphs for modeling connectedness in digital spaces

Popis výsledku anglicky

For undirected simple graphs, we introduce closure operators on their vertex sets induced by sets of walks of the same lengths. Some basic properties of these closure operators are studied, with greater attention paid to connectedness. We focus on the closure operators induced by certain sets of walks in the 2-adjacency graph on the digital line Z, which generalize the Khalimsky topology. For the closure operators on Z^2 obtained as particularly defined products of pairs of the induced closure operators on Z, we formulate and prove a digital form of the Jordan curve theorem.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

FILOMAT

ISSN

0354-5180

e-ISSN

2406-0933

Svazek periodika

32

Číslo periodika v rámci svazku

14

Stát vydavatele periodika

RS - Srbská republika

Počet stran výsledku

11

Strana od-do

5011-5021

Kód UT WoS článku

000461183400018

EID výsledku v databázi Scopus

2-s2.0-85060868606