6533b856fe1ef96bd12b1e01
RESEARCH PRODUCT
About Graph Mappings
Sebastian Kochsubject
Discrete mathematicsgraph isomorphism05c60Applied Mathematics020207 software engineering0102 computer and information sciences02 engineering and technology68t9901 natural sciencesComputational Mathematicsgraph homomorphism03b35010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringQA1-939Graph (abstract data type)Graph homomorphismGraph isomorphismMathematicsMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2019-10-01 | Formalized Mathematics |