W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/10834Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Koch, Sebastian | - |
| dc.date.accessioned | 2021-05-04T08:27:42Z | - |
| dc.date.available | 2021-05-04T08:27:42Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 28, Issue 2, Pages 173-186 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/10834 | - |
| dc.description.abstract | A (di)graph without parallel edges can simply be represented by a binary relation of the vertices and on the other hand, any binary relation can be expressed as such a graph. In this article, this correspondence is formalized in the Mizar system [2], based on the formalization of graphs in [6] and relations in [11], [12]. Notably, a new definition of createGraph will be given, taking only a non empty set V and a binary relation E ⊆ V × V to create a (di)graph without parallel edges, which will provide to be very useful in future articles. | pl |
| dc.language.iso | en | pl |
| dc.publisher | DeGruyter Open | pl |
| dc.rights | Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) | - |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/3.0/ | - |
| dc.subject | graph theory | pl |
| dc.subject | binary relation | pl |
| dc.title | Unification of Graphs and Relations in Mizar | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2020 University of Białymstoku; | - |
| dc.rights.holder | CC-BY-SA License ver. 3.0 or later; | - |
| dc.identifier.doi | 10.2478/forma-2020-0015 | - |
| dc.description.Email | skoch02@students.uni-mainz.de | pl |
| dc.description.Affiliation | Johannes Gutenberg University, Mainz, Germany | pl |
| dc.description.references | 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. | pl |
| dc.description.references | 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. | pl |
| dc.description.references | 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. | pl |
| dc.description.references | Ulrich Knauer. Algebraic graph theory: morphisms, monoids and matrices, volume 41 of De Gruyter Studies in Mathematics. Walter de Gruyter, 2011. | pl |
| dc.description.references | Sebastian Koch. Underlying simple graphs. Formalized Mathematics, 27(3):237–259, 2019. doi:10.2478/forma-2019-0023. | pl |
| dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005. | pl |
| dc.description.references | Karol Pąk. The friendship theorem. Formalized Mathematics, 20(3):235–237, 2012. doi:10.2478/v10037-012-0028-7. | pl |
| dc.description.references | Gunther Schmidt and Thomas Ströhlein. Relations and graphs: discrete mathematics for computer scientists. Springer Science & Business Media, 2012. | pl |
| dc.description.references | Yozo Toda. The formalization of simple graphs. Formalized Mathematics, 5(1):137–144, 1996. | pl |
| dc.description.references | Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1. | pl |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990. | pl |
| dc.identifier.eissn | 1898-9934 | - |
| dc.description.volume | 28 | pl |
| dc.description.issue | 2 | pl |
| dc.description.firstpage | 173 | pl |
| dc.description.lastpage | 186 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| dc.identifier.orcid | 0000-0002-9628-177X | - |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2020, Volume 28, Issue 2 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| 10.2478_forma-2020-0015.pdf | 281,82 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
