关于图映射

IF 1 Q1 MATHEMATICS

Formalized Mathematics Pub Date : 2019-10-01 DOI:10.2478/forma-2019-0024

Sebastian Koch

{"title":"关于图映射","authors":"Sebastian Koch","doi":"10.2478/forma-2019-0024","DOIUrl":null,"url":null,"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.","PeriodicalId":42667,"journal":{"name":"Formalized Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"About Graph Mappings\",\"authors\":\"Sebastian Koch\",\"doi\":\"10.2478/forma-2019-0024\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":42667,\"journal\":{\"name\":\"Formalized Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Formalized Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/forma-2019-0024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Formalized Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/forma-2019-0024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

在本文中，从一个图到另一个图的邻接保持映射在Mizar系统中形式化[7]，[2]。据作者所知，这种方法的普遍性似乎在文献中是前所未有的。然而，本文定义的最重要的性质是两个图是同构的，这个性质已经被广泛研究。另外还介绍了另一个图形装饰器。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

About Graph Mappings

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Formalized Mathematics MATHEMATICS-

自引率

0.00%

发文量

审稿时长

10 weeks

期刊介绍： Formalized Mathematics is to be issued quarterly and publishes papers which are abstracts of Mizar articles contributed to the Mizar Mathematical Library (MML) - the basis of a knowledge management system for mathematics.