A digital Jordan surface theorem with respect to a graph connectedness

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F23%3APU150073" target="_blank" >RIV/00216305:26210/23:PU150073 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.degruyter.com/document/doi/10.1515/math-2023-0172/html" target="_blank" >https://www.degruyter.com/document/doi/10.1515/math-2023-0172/html</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1515/math-2023-0172" target="_blank" >10.1515/math-2023-0172</a>

Jazyk výsledku
angličtina
Název v původním jazyce
A digital Jordan surface theorem with respect to a graph connectedness
Popis výsledku v původním jazyce
After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z with a certain set of paths of length n for every positive integer n . The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.
Název v anglickém jazyce
A digital Jordan surface theorem with respect to a graph connectedness
Popis výsledku anglicky
After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z with a certain set of paths of length n for every positive integer n . The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.

Rok uplatnění
2023
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ů

Podobné výsledky(10)