Publication detail

A digital Jordan surface theorem with respect to a graph connectedness

ŠLAPAL, J.

English title

A digital Jordan surface theorem with respect to a graph connectedness

Type

journal article in Web of Science

Language

en

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.

English 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 in English

simple graph, strong product, path, connectedness, digital space, Jordan surface; MSC 2020: 52C22, 68R10

Released

31.12.2023

Publisher

De Gruyter

Location

Poland

ISSN

2391-5455

Volume

21

Number

1

Pages from–to

1–9

Pages count

9

BIBTEX


@article{BUT186967,
  author="Josef {Šlapal},
  title="A digital Jordan surface theorem with respect to a graph connectedness",
  year="2023",
  volume="21",
  number="1",
  month="December",
  pages="1--9",
  publisher="De Gruyter",
  address="Poland",
  issn="2391-5455"
}