Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/7621
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Koch, Sebastian | - |
dc.date.accessioned | 2019-03-04T10:26:06Z | - |
dc.date.available | 2019-03-04T10:26:06Z | - |
dc.date.issued | 2018/07/01 | - |
dc.identifier.citation | Formalized Mathematics, Volume 26, Issue 2, Pages 101-124 | - |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/7621 | - |
dc.description.abstract | Drawing a finite graph is usually done by a finite sequence of the following three operations. 1. Draw a vertex of the graph. 2. Draw an edge between two vertices of the graph. 3. Draw an edge starting from a vertex of the graph and immediately draw a vertex at the other end of it.By this procedure any finite graph can be constructed. This property of graphs is so obvious that the author of this article has yet to find a reference where it is mentioned explicitly. In introductionary books (like [10], [5], [9]) as well as in advanced ones (like [4]), after the initial definition of graphs the examples are usually given by graphical representations rather than explicit set theoretic descriptions, assuming a mutual understanding how the representation is to be translated into a description fitting the definition. However, Mizar [2], [3] does not possess this innate ability of humans to translate pictures into graphs. Therefore, if one wants to create graphs in Mizar without directly providing a set theoretic description (i.e. using the createGraph functor), a rigorous approach to the constructing operations is required.In this paper supergraphs are defined as an inverse mode to subgraphs as given in [8]. The three graph construction operations are defined as modes extending Supergraph similar to how the various remove operations were introduced as submodes of Subgraph in [8]. Many theorems are proven that describe how graph properties are transferred to special supergraphs. In particular, to prove that disconnected graphs cannot become connected by adding an edge between two vertices that lie in the same component, the theory of replacing a part of a walk with another walk is introduced in the preliminaries. | - |
dc.language.iso | en | - |
dc.publisher | DeGruyter Open | - |
dc.subject | supergraph | - |
dc.subject | graph operations | - |
dc.title | About Supergraphs. Part I | - |
dc.type | Article | - |
dc.identifier.doi | 10.2478/forma-2018-0009 | - |
dc.description.Affiliation | Johannes Gutenberg University, Mainz, Germany | pl |
dc.description.references | Jesse Alama. Euler’s polyhedron formula. Formalized Mathematics, 16(1):7–17, 2008. doi:10.2478/v10037-008-0002-6. | - |
dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17. | - |
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. | - |
dc.description.references | Lowell W. Beineke and Robin J. Wilson, editors. Selected Topics in Graph Theory. Academic Press, London, 1978. ISBN 0-12-086250-6. | - |
dc.description.references | John Adrian Bondy and U. S. R. Murty. Graph Theory. Graduate Texts in Mathematics, 244. Springer, New York, 2008. ISBN 978-1-84628-969-9. | - |
dc.description.references | Gilbert Lee. Walks in graphs. Formalized Mathematics, 13(2):253–269, 2005. | - |
dc.description.references | Gilbert Lee. Trees and graph components. Formalized Mathematics, 13(2):271–277, 2005. | - |
dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005. | - |
dc.description.references | Klaus Wagner. Graphentheorie. B.I-Hochschultaschenbücher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4. | - |
dc.description.references | Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1. | - |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 26 | - |
dc.description.issue | 2 | - |
dc.description.firstpage | 101 | - |
dc.description.lastpage | 124 | - |
dc.identifier.citation2 | Formalized Mathematics | - |
dc.identifier.orcid | 0000-0002-9628-177X | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2018, Volume 26, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma_2018_26_2_002.pdf | 268,7 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL