Publication detail
A digital Jordan surface theorem with respect to a graph connectedness
ŠLAPAL, J.
Original Title
A digital Jordan surface theorem with respect to a graph connectedness
Type
journal article in Web of Science
Language
English
Original Abstract
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.
Keywords
simple graph, strong product, path, connectedness, digital space, Jordan surface; MSC 2020: 52C22, 68R10
Authors
ŠLAPAL, J.
Released
31. 12. 2023
Publisher
De Gruyter
Location
Poland
ISBN
2391-5455
Periodical
Open Mathematics
Year of study
21
Number
1
State
Republic of Poland
Pages from
1
Pages to
9
Pages count
9
URL
Full text in the Digital Library
BibTex
@article{BUT186967,
author="Josef {Šlapal}",
title="A digital Jordan surface theorem with respect to a graph connectedness",
journal="Open Mathematics",
year="2023",
volume="21",
number="1",
pages="1--9",
doi="10.1515/math-2023-0172",
issn="2391-5455",
url="https://www.degruyter.com/document/doi/10.1515/math-2023-0172/html"
}