Cite

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.

eISSN:
1898-9934
ISSN:
1426-2630
Language:
English
Publication timeframe:
Volume Open
Journal Subjects:
Computer Sciences, other, Mathematics, General Mathematics