
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 012
- Pages: 153-160
- Published: 31/10/1992
We consider certain resolvable designs which have applications to doubly perfect Cartesian authentication schemes. These generalize structures determined by sets of mutually orthogonal Latin squares and are related to semi-Latin squares and other designs which find applications in the design of experiments.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 141-151
- Published: 31/10/1992
A
is shown. It is also shown that a
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 129-140
- Published: 31/10/1992
We consider the changing and unchanging of the edge covering and edge independence numbers of a graph when the graph is modified by deleting a node, deleting an edge, or adding an edge. In this paper, we present characterizations for the graphs in each of these classes and some relationships among them.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 119-127
- Published: 31/10/1992
Let
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 109-117
- Published: 31/10/1992
We investigate the edge-gracefulness of
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 97-108
- Published: 31/10/1992
For
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 77-96
- Published: 31/10/1992
We prove that there exist precisely
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 65-76
- Published: 31/10/1992
The known generalized quadrangles with parameters
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 57-64
- Published: 31/10/1992
In this paper, we illustrate the relationship between profiles of Hadamard matrices and weight distributions of codes, give a new and efficient method to determine the minimum weight
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 33-56
- Published: 31/10/1992
We define an
We establish that every vertex of degree at least