Embeddings of Graphs: Tessellate and Decussate Structures
International Journal of Topology · 2024
DOI: 10.3390/ijt1010001 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Topology, 2024. Verfasst von Michael O’Keeffe und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We address the problem of finding a unique graph embedding that best describes a graph’s “topology” i.e., a canonical embedding (spatial graph). This question is of particular interest in the chemistry of materials. Graphs that admit a tiling in 3-dimensional Euclidean space are termed tessellate, those that do not decussate. We give examples of decussate and tessellate graphs that are finite and 3-periodic. We conjecture that a graph has at most one tessellate embedding. We give reasons for considering this the default “topology” of periodic graphs.
Zitieren
APA
O’Keeffe, M., & Treacy, M. M. J. (2024). Embeddings of Graphs: Tessellate and Decussate Structures. International Journal of Topology. https://doi.org/10.3390/ijt1010001
Vancouver
O’Keeffe M, Treacy MMJ. Embeddings of Graphs: Tessellate and Decussate Structures. International Journal of Topology. 2024. doi:10.3390/ijt1010001
BibTeX
@article{OKeeffe2024,
author = {O’Keeffe, Michael and Treacy, Michael M. J.},
title = {Embeddings of Graphs: Tessellate and Decussate Structures},
journal = {International Journal of Topology},
year = {2024},
doi = {10.3390/ijt1010001}
}
EUVIMED