Detail publikace

A digital Jordan surface theorem with respect to a graph connectedness

ŠLAPAL, J.

Anglický název

A digital Jordan surface theorem with respect to a graph connectedness

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova anglicky

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

Vydáno

31.12.2023

Nakladatel

De Gruyter

Místo

Poland

ISSN

2391-5455

Ročník

21

Číslo

1

Strany od–do

1–9

Počet stran

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"
}