Abstract
Abstract
In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
Subject
Applied Mathematics,Computational Mathematics
Reference12 articles.
1. Broderick Arneson and Piotr Rudnicki. Chordal graphs. Formalized Mathematics, 14(3): 79–92, 2006. doi:10.2478/v10037-006-0010-3.
2. 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.
3. 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.
4. Ricky W. Butler and Jon A. Sjogren. A PVS graph theory library. Technical report, NASA Langley, 1998.
5. Ching-Tsun Chou. A formal theory of undirected graphs in higher-order logic. In Thomas F. Melham and Juanito Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, 7th International Workshop, Valletta, Malta, September 19–22, 1994, Proceedings, volume 859 of Lecture Notes in Computer Science, pages 144–157. Springer, 1994. doi:10.1007/3-540-58450-1 40.