
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN: 0835-3026 (print) 2817-576X (online)
The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) embarked on its publishing journey in April 1987. From 2024 onward, it publishes four volumes per year in March, June, September and December. JCMCC has gained recognition and visibility in the academic community and is indexed in renowned databases such as MathSciNet, Zentralblatt, Engineering Village and Scopus. The scope of the journal includes; Combinatorial Mathematics, Combinatorial Computing, Artificial Intelligence and applications of Artificial Intelligence in various files.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 155-159
- Published: 28/02/1996
A graph is said to be in
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 139-154
- Published: 28/02/1996
On the basis of circuit uniqueness, the concept of strong circuit uniqueness is introduced, and some graphs with the property of strong circuit uniqueness are identified. The results are then used to prove successfully the circuit uniqueness of the graphs
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 129-137
- Published: 28/02/1996
Several criteria have been proposed as desirable for binary cryptographic functions. Three important ones are balance, correlation-immunity, and higher order strict avalanche criterion. Lloyd [7] has shown that there are no balanced, uncorrelated functions which satisfy the strict avalanche criterion of order
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 121-128
- Published: 28/02/1996
In this paper, we introduce some concepts relating to idempotent ordered orthogonal quasigroups (IOOQ), ordered orthogonal Steiner triple systems (ordered OSTS), and ordered orthogonal group divisible designs (ordered OGDD), and use them to obtain some construction methods for OGDD.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 111-120
- Published: 28/02/1996
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 97-109
- Published: 28/02/1996
It is known that triangle-free graphs of diameter
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 89-96
- Published: 28/02/1996
Dey’s formula can be used to count the subgroups of finitely generated groups and to establish congruence properties of subgroup counting functions. We develop an algebraic technique based on this formula for counting the subgroups of given index in Hecke groups, and show how to streamline it for efficient computation modulo
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 65-80
- Published: 28/02/1996
A simple graph
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 53-63
- Published: 28/02/1996
Given a graph
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 020
- Pages: 33-52
- Published: 28/02/1996
The set of all possible intersection sizes between two simple triple systems