GitHub

Elements of Discrete Mathematics with Rust

This repository provides simple code snippets and implementations in Rust programming language for understanding various topics in discrete mathematics. The code examples and explanations are designed ...
Scientific Research Publishing

Caprara, A. (1999) Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM Journal on Discrete Mathematics, 12, 91-110.

ABSTRACT: Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles Ciin G such that s is maximum. In general, the maximum cycle packing ...
GitHub

Discrete_Mathematics_Explained_in_Detail /CH06_Counting

$$ \begin{array}{l}{C\left(n, n_{1}\right) C\left(n-n_{1}, n_{2}\right) \cdots C\left(n-n_{1}-\cdots-n_{k-1}, n_{k}\right)} \ {=\frac{n !}{n_{1} !\left(n-n_{1}\right ...
Scientific Research Publishing

Skiena, S. (1990) The Cycle Structure of Permutations 1.2.4. In: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Addison-Wesley, Reading, 20-24.

ABSTRACT: The spectral properties of special matrices have been widely studied, because of their applications. We focus on permutation matrices over a finite field and, more concretely, we compute the ...