Path-set induced closure operators on graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F16%3APU115542" target="_blank" >RIV/00216305:26210/16:PU115542 - isvavai.cz</a>
Result on the web
<a href="https://journal.pmf.ni.ac.rs/filomat/index.php/filomat/article/view/3285" target="_blank" >https://journal.pmf.ni.ac.rs/filomat/index.php/filomat/article/view/3285</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.2298/FIL1603863S" target="_blank" >10.2298/FIL1603863S</a>
Alternative languages
Result language
angličtina
Original language name
Path-set induced closure operators on graphs
Original language description
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 Z^2 are discussed which include the well known Marcus-Wyse and Khalimsky topologies used in digital topology.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
FILOMAT
ISSN
0354-5180
e-ISSN
2406-0933
Volume of the periodical
30
Issue of the periodical within the volume
3
Country of publishing house
RS - THE REPUBLIC OF SERBIA
Number of pages
9
Pages from-to
863-871
UT code for WoS article
000376574100037
EID of the result in the Scopus database
2-s2.0-84965162659