Affiliation:
1. Johannes Gutenberg University Mainz , Germany
Abstract
Summary
In [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.
Subject
Applied Mathematics,Computational Mathematics
Reference8 articles.
1. [1] Ian Anderson. A first course in discrete mathematics. Springer Undergraduate Mathematics Series. Springer, London, 2001. ISBN 1-85233-236-0.10.1007/978-0-85729-315-2_1
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] Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.10.1007/s10817-015-9345-1
4. [4] Pavol Hell and Jaroslav Nesetril. Graphs and homomorphisms. Oxford Lecture Series in Mathematics and Its Applications; 28. Oxford University Press, Oxford, 2004. ISBN 0-19-852817-5.
5. [5] Ulrich Knauer. Algebraic graph theory: morphisms, monoids and matrices, volume 41 of De Gruyter Studies in Mathematics. Walter de Gruyter, 2011.10.1515/9783110255096