Affiliation:
1. Johannes Gutenberg University Mainz , Germany
Abstract
Summary
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.
Subject
Applied Mathematics,Computational Mathematics
Reference16 articles.
1. [1] Grzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421–427, 1990.
2. [2] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.10.1007/s10817-017-9440-6
3. [3] John Adrian Bondy and U. S. R. Murty. Graph Theory. Graduate Texts in Mathematics, 244. Springer, New York, 2008. ISBN 978-1-84628-969-9.
4. [4] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.
5. [5] Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Miscellaneous Graph Preliminaries. Part I;Formalized Mathematics;2021-04-01
2. Miscellaneous Graph Preliminaries;Formalized Mathematics;2020-04-01
3. About Vertex Mappings;Formalized Mathematics;2019-10-01