About this article
Published Online: Feb 17, 2020
Page range: 261 - 301
Accepted: Aug 29, 2019
DOI: https://doi.org/10.2478/forma-2019-0024
Keywords
© 2019 Sebastian Koch, published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 License.
In this articles adjacency-preserving mappings from a graph to another are formalized in the Mizar system [7], [2]. The generality of the approach seems to be largely unpreceeded in the literature to the best of the author’s knowledge. However, the most important property defined in the article is that of two graphs being isomorphic, which has been extensively studied. Another graph decorator is introduced as well.