Terse walk sets in graphs and induced closure operators

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU126476" target="_blank" >RIV/00216305:26230/17:PU126476 - isvavai.cz</a>
Result on the web
<a href="http://www.fit.vutbr.cz/research/pubs/all.php?id=11591" target="_blank" >http://www.fit.vutbr.cz/research/pubs/all.php?id=11591</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.topol.2017.08.046" target="_blank" >10.1016/j.topol.2017.08.046</a>

Result language
angličtina
Original language name
Terse walk sets in graphs and induced closure operators
Original language description
Given a graph G, for every ordinal a > 1, we introduce and study closure operators on G induced by sets of a-indexed walks. For such sets, we define a property called terseness and investigate how it affects the induced closure operators. We show, among others, that the induction, if regarded as a map, is one-to-one for terse walk sets. We also determine a poset of closure operators (on a given graph) that is a direct limit of a direct system of sets of terse a-indexed walks ordered by set inclusion for certain ordinals a > 1. Possible applications of the closure operators studied in digital topology are indicated.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)