Basic Properties of Metrizable Topological Spaces

We continue Mizar formalization of general topology according to the book [11] by Engelking. In the article, we present the final theorem of Section 4.1. Namely, the paper includes the formalization of theorems on the correspondence between the cardinalities of the basis and of some open subcover, and a discreet (closed) subspaces, and the weight of that metrizable topological space. We also define Lindel¨of spaces and state the above theorem in this special case. We also introduce the concept of separation among two subsets (see [12]).Institute of Computer Science, University of Białystok, PolandGrzegorz Bancerek. Cardinal arithmetics. Formalized Mathematics, 1(3):543-547, 1990.Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Józef Białas and Yatsuka Nakamura. The theorem of Weierstrass. Formalized Mathematics, 5(3):353-359, 1996.Leszek Borys. Paracompact and metrizable spaces. Formalized Mathematics, 2(4):481-485, 1991.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Agata Darmochwał. Families of subsets, subspaces and mappings in topological spaces. Formalized Mathematics, 1(2):257-261, 1990.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Agata Darmochwał. The Euclidean space. Formalized Mathematics, 2(4):599-603, 1991.Ryszard Engelking. General Topology, volume 60 of Monografie Matematyczne. PWN-Polish Scientific Publishers, Warsaw, 1977.Ryszard Engelking. Teoria wymiaru. PWN, 1981.Adam Grabowski. Properties of the product of compact topological spaces. Formalized Mathematics, 8(1):55-59, 1999.Adam Grabowski. On the Borel families of subsets of topological spaces. Formalized Mathematics, 13(4):453-461, 2005.Adam Grabowski. On the boundary and derivative of a set. Formalized Mathematics, 13(1):139-146, 2005.Stanisława Kanas, Adam Lecko, and Mariusz Startek. Metric spaces. Formalized Mathematics, 1(3):607-610, 1990.Zbigniew Karno. Maximal discrete subspaces of almost discrete topological spaces. Formalized Mathematics, 4(1):125-135, 1993.Robert Milewski. Bases of continuous lattices. Formalized Mathematics, 7(2):285-294, 1998.Beata Padlewska and Agata Darmochwał. Topological spaces and continuous functions. Formalized Mathematics, 1(1):223-230, 1990.Alexander Yu. Shibakov and Andrzej Trybulec. The Cantor set. Formalized Mathematics, 5(2):233-236, 1996.Andrzej Trybulec. A Borsuk theorem on homotopy types. Formalized Mathematics, 2(4):535-545, 1991.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990

Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs

In the original article ``Wiener index of Eulerian graphs'' [Discrete Applied Mathematics Volume 162, 10 January 2014, Pages 247-250], the authors state that the Wiener index (total distance) of an Eulerian graph is maximized by the cycle. We explain that the initial proof contains a flaw and note that it is a corollary of a result by Plesn\'ik, since an Eulerian graph is $2$-edge-connected. The same incorrect proof is used in two referencing papers, ``Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs'' [Bull. Malays. Math. Sci. Soc. (2019) 42:67-78] and ``Harary index of Eulerian graphs'' [J. Math. Chem., 59(5):1378-1394, 2021]. We give proofs of the main results of those papers and the $2$-edge-connected analogues.Comment: 5 Pages, 1 Figure Corrigendum of 3 papers, whose titles are combine

On the algorithmic complexity of twelve covering and independence parameters of graphs

The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

Why Delannoy numbers?

This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference