Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

Discrete mathematics is the real-world application of numbers. Fields that rely on discrete mathematics include computer science and cryptography.

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...

MATH.3220 — Online and Continuing Education Id: 008322 Offering: 2 Credits: 3-3 Description Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

Discrete Mathematics 323. (2014): 81-83. Print. * Wenger, Paul S. "Fractional Acquisition in Graphs." Discrete Applied Mathematics 178. (2014): 142-148. Print. * Published Conference Proceedings ...

MATH.2190 — Undergraduate Id: 008321 Offering: 1 Credits: 3-3 Description Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, ...

L. Stacho, A sufficient condition guaranteeing large cycles in graphs, Discrete Mathematics 169 (1997), 273-277. L. Stacho, A new Chvatal type condition for pancyclicity, Graphs and Combinatorics 13 ...

Ismael González Yero, Juan Alberto Rodríguez-Velázquez, ROMAN DOMINATION IN CARTESIAN PRODUCT GRAPHS AND STRONG PRODUCT GRAPHS, Applicable Analysis and Discrete Mathematics, Vol. 7, No. 2 (October ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...