Discrete mathematics

Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements in logic-do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefor excludes topics in "continuous mathematics" such as calculus and analysis. "Discrete mathematics" contains eight chapters. First chapter ensures the aspects of discrete mathematics and probability in the theory of machine learning. Using discrete fuzzy members in the aggregation of incomplete qualitative information has been described in chapter second. Third chapter examines discrete Legendre spectral projection methods for Fredholm-ham-merstein integral equations. Fourth chapter presents the discrete agglomeration model with equivalent problems. Spine in compression methods for singularly perturbed 1D parabolic equations with singular coefficients have been discussed in chapter fifth. Sixth chapter reviews the equidistributional in sharing games. Seventh chapter focuses on dominating sets and dominating sets and domination polynomials of square of paths. Last chapter provides the polynomial-time algorithm to find a partial poset cover problem.